{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:21:48Z","timestamp":1772637708286,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,10]]},"DOI":"10.1007\/bf02591946","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:36:38Z","timestamp":1175168198000},"page":"214-231","source":"Crossref","is-referenced-by-count":23,"title":["Maximum-throughput dynamic network flows"],"prefix":"10.1007","volume":"27","author":[{"given":"James B.","family":"Orlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591946_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/nav.3800040205","volume":"4","author":"T.E. Bartlett","year":"1957","unstructured":"T.E. Bartlett, \u201cAn algorithm for the minimum number of transport units to maintain a fixed schedule\u201d,Naval Research Logistics Quarterly 4 (1957) 139\u2013149.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591946_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/nav.3800040308","volume":"4","author":"T.E. Bartlett","year":"1957","unstructured":"T.E. Bartlett and A. Charnes, \u201cCyclic scheduling and combinatorial topology: assignment and routing of motive power to meet scheduling and maintenance requirements. Part II: generalization and analysis\u201d,Naval Research Logistics Quarterly 4 (1957) 207\u2013220.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591946_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800010309","volume":"1","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig and D.R. Fulkerson, \u201cMinimizing the number of tankers to meet a fixed schedule\u201d,Naval Research Logistics Quarterly 1 (1954) 217\u2013222.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591946_CR4","unstructured":"G.B. Dantzig, Consulting work for United Airlines (1962)."},{"key":"BF02591946_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems\u201d,Journal of the Association of Computing Machinery 19 (1972) 248\u2013264.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"BF02591946_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0021-9800(70)80006-0","volume":"8","author":"J. Folkman","year":"1970","unstructured":"J. Folkman and D.R. Fulkerson, \u201cFlows in infinite graphs\u201d,Journal of Combinatorial Theory 8 (1970) 30\u201344.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF02591946_CR7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"L.R. Ford and D.R. Fulkerson, \u201cMaximum flow through a network\u201d,Canadian Journal Mathematics 8 (1956) 399\u2013404.","journal-title":"Canadian Journal Mathematics"},{"key":"BF02591946_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"L.R. Ford and D.R. Fulkerson, \u201cConstructing maximal dynamic flows from static flows\u201d,Operations Research 6 (1958) 419\u2013433.","journal-title":"Operations Research"},{"key":"BF02591946_CR9","volume-title":"Flows in networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"BF02591946_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"D. Gale, \u201cTransient flows in networks\u201d,Michigan Mathematical Journal 6 (1959) 59\u201363.","journal-title":"Michigan Mathematical Journal"},{"key":"BF02591946_CR11","volume-title":"Computers and intractibility: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractibility: a guide to the theory of NP-completeness (W.H. Freeman and Co., San Francisco, 1979)."},{"key":"BF02591946_CR12","series-title":"Management Science Report No. 77-4","volume-title":"The netform concept: a more effective model form and solution procedure for large scale non-linear problems","author":"F. Glover","year":"1977","unstructured":"F. Glover, D. Klingman and C. McMillan, \u201cThe netform concept: a more effective model form and solution procedure for large scale non-linear problems\u201d, Management Science Report No. 77-4, Graduate School of Business Administration, University of Colorado (Boulder, CO, 1977)."},{"key":"BF02591946_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems\u201d, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computations (Plenum Press, New York, 1972) pp. 85\u2013103."},{"key":"BF02591946_CR14","volume-title":"Combinatorial optimization: networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial optimization: networks and matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"BF02591946_CR15","series-title":"Working Paper","volume-title":"Analysis of dynamic material handling systems by network flow","author":"W.L. Maxwell","year":"1978","unstructured":"W.L. Maxwell and R.C. Wilson, \u201cAnalysis of dynamic material handling systems by network flow\u201d, Working Paper No. 4, Department of Industrial Operations Engineering, University of Michigan (Ann Arbor, Michigan, 1978)."},{"key":"BF02591946_CR16","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"E. Minieka, \u201cMaximal lexicographic and dynamic network flows\u201d,Operations Research 21 (1973) 517\u2013527.","journal-title":"Operations Research"},{"key":"BF02591946_CR17","volume-title":"Dynamic convex programming","author":"J.B. Orlin","year":"1981","unstructured":"J.B. Orlin, \u201cDynamic convex programming,\u201d Chapter II, Ph.D. dissertation, Department of Operations Research, Stanford University (Stanford, CA, 1981)."},{"key":"BF02591946_CR18","volume-title":"Minimum-convex-cost dynamic network flows, Chapter IV","author":"J.B. Orlin","year":"1981","unstructured":"J.B. Orlin, \u201cMinimum-convex-cost dynamic network flows, Chapter IV\u201d, Ph.D. dissertation, Department of Operations Research, Stanford University (Stanford, CA, 1981)."},{"key":"BF02591946_CR19","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.30.4.760","volume":"30","author":"J.B. Orlin","year":"1982","unstructured":"J.B. Orlin, \u201cMinimizing the number of vehicles to meet a fixed periodic schedule: An application of periodic posets\u201d,Operations Research 30 (1982) 760\u2013776.","journal-title":"Operations Research"},{"key":"BF02591946_CR20","series-title":"Report FTL-R68-3","first-page":"100","volume-title":"Scheduling and routing models for airline systems","author":"R.W. Simpson","year":"1969","unstructured":"R.W. Simpson, \u201cScheduling and routing models for airline systems\u201d, Report FTL-R68-3, Department of Aeronautics and Astronautics, M.I.T. (Cambridge, MA, 1969) pp. 100\u2013107 and 128\u2013134."},{"key":"BF02591946_CR21","unstructured":"R.D. Wollmer, \u201cAn airline schedule tail routing algorithm\u201d, presented at the ORSA\/TIMS Conference (Colorado Springs, CO, 1980)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591946.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591946\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:51Z","timestamp":1558381071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["BF02591946"],"URL":"https:\/\/doi.org\/10.1007\/bf02591946","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}