{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:07Z","timestamp":1742913787089,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":6,"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_373","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2095-2108","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Cost Flow Problem"],"prefix":"10.1007","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"373_CR1_373","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":"373_CR2_373","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1137\/0218039","volume":"18","author":"F. Barahona","year":"1989","unstructured":"Barahona F, Tardos E (1989) Note of Weintraub's minimum cost circulation algorithm. SIAM J Comput 18:579\u2013583","journal-title":"SIAM J. Comput."},{"key":"373_CR3_373","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":"373_CR4_373","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Tarjan RE (1988) Finding minimum-cost circulations by canceling negative cycles. Proc. 20th ACM Symposium on the Theory of Computing, pp 388\u2013397. Full paper: J ACM (1989) 36:873\u2013886","DOI":"10.1145\/76359.76368"},{"key":"373_CR5_373","doi-asserted-by":"crossref","unstructured":"Orlin JB (1988) A\u00a0faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. Theory of Computing, pp 377\u2013387. Full paper: Oper Res (1989) 41:338\u2013350","DOI":"10.1287\/opre.41.2.338"},{"key":"373_CR6_373","first-page":"109","volume":"78B","author":"J.B. Orlin","year":"1997","unstructured":"Orlin JB (1997) A\u00a0polynomial time primal network simplex algorithm for minimum cost flows. Math Program 78B:109\u2013129","journal-title":"Math. Program."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:41:48Z","timestamp":1720690908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_373","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}