{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:27:14Z","timestamp":1759336034196,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_361","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2009-2020","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Flow Problem"],"prefix":"10.1007","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"361_CR1_361","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","volume":"97","author":"R.K. Ahuja","year":"1997","unstructured":"Ahuja RK, Kodialam M, Mishra AK, Orlin JB (1997) Computational investigations of maximum flow algorithms. Europ J Oper Res 97:509\u2013542","journal-title":"Europ. J. Oper. Res."},{"key":"361_CR2_361","volume-title":"Network flows: Theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"361_CR3_361","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1287\/opre.37.5.748","volume":"37","author":"R.K. Ahuja","year":"1989","unstructured":"Ahuja RK, Orlin JB (1989) A\u00a0fast and simple algorithm for the maximum flow problem. Oper Res 37:748\u2013759","journal-title":"Oper. Res."},{"key":"361_CR4_361","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1137\/0218072","volume":"18","author":"J. Cheriyan","year":"1989","unstructured":"Cheriyan J, Maheshwari SN (1989) Analysis of preflow-push algorithms for maximum network flow. SIAM J Comput 18:1057\u20131086","journal-title":"SIAM J. Comput."},{"key":"361_CR5_361","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic EA (1970) Algorithm for solution of a\u00a0problem of maximum flow in networks with power estimation. Soviet Math Dokl 11:1277\u20131280","journal-title":"Soviet Math. Dokl."},{"key":"361_CR6_361","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J\u00a0ACM 19:248\u2013264","journal-title":"J. ACM"},{"key":"361_CR7_361","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"IT-2","author":"P. Elias","year":"1956","unstructured":"Elias P, Feinstein A, Shannon CE (1956) Note on maximum flow through a\u00a0network. IRE Trans Inform Theory IT-2:117\u2013119","journal-title":"IRE Trans. Inform. Theory"},{"key":"361_CR8_361","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a\u00a0network. Canad J Math 8:399\u2013404","journal-title":"Canad. J. Math."},{"key":"361_CR9_361","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H.N. Gabow","year":"1985","unstructured":"Gabow HN (1985) Scaling algorithms for network problems. J\u00a0Comput Syst Sci 31:148\u2013168","journal-title":"J. Comput. Syst. Sci."},{"key":"361_CR10_361","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A\u00a0new approach to the maximum flow problem. J\u00a0ACM 35:921\u2013940, also: Proc. 19th ACM Symp. Theory of Computing, pp 136\u2013146","journal-title":"J. ACM"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:39:14Z","timestamp":1720690754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_361","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}