{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:40:24Z","timestamp":1758267624892},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_47","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"295-300","source":"Crossref","is-referenced-by-count":6,"title":["Network Flow Optimization with Minimum Quantities"],"prefix":"10.1007","author":[{"given":"Hans Georg","family":"Seedig","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"key":"47_CR1_47","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s101070050058","volume":"85","author":"Boris Vasilievich Cherkassky","year":"1999","unstructured":"Boris Vasilievich Cherkassky and Andrew Vladislav Goldberg. Negative-cycle detection algorithms. Mathematical Programming, 85: 277\u2013311, 1999.","journal-title":"Mathematical Programming"},{"issue":"1","key":"47_CR2_47","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"Dalila Benedita Machado Martins Fontes","year":"2006","unstructured":"Dalila Benedita Machado Martins Fontes, Eleni Hadjiconstantinou, and Nicos Christofides. A branch-and-bound algorithm for concave network flow problems. Journal of Global Optimization, 34(1): 127\u2013155, 2006.","journal-title":"Journal of Global Optimization"},{"unstructured":"Michael Randolph Garey and David Stifler Johnson. Computers and Intractability : A Guide to the Theory of NP-Completeness. W. H. Freeman, January 1979.","key":"47_CR3_47"},{"key":"47_CR4_47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"Andrew Vladislav Goldberg","year":"1997","unstructured":"Andrew Vladislav Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22: 1\u201329, 1997.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"47_CR5_47","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"Andrew Vladislav Goldberg","year":"1989","unstructured":"Andrew Vladislav Goldberg and Robert Endre Tarjan. Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM, 36(4): 873\u2013886, 1989.","journal-title":"Journal of the ACM"},{"issue":"1","key":"47_CR6_47","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-007-0172-6","volume":"153","author":"Dorit Simona Hochbaum","year":"2007","unstructured":"Dorit Simona Hochbaum. Complexity and algorithms for nonlinear optimization problems. Annals of Operations Research, 153(1): 257\u2013296, 2007.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"47_CR7_47","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"James Berger Orlin","year":"1993","unstructured":"James Berger Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2): 338\u2013350, 1993.","journal-title":"Operations Research"},{"issue":"3","key":"47_CR8_47","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/mnsc.5.3.304","volume":"5","author":"Harvey Maurice Wagner","year":"1959","unstructured":"Harvey Maurice Wagner. On a class of capacitated transportation problems. Management Science, 5(3): 304\u2013318, 1959.","journal-title":"Management Science"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:59:26Z","timestamp":1619787566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_47","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]}}}