{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:48:43Z","timestamp":1768913323395,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T00:00:00Z","timestamp":1427241600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10878-015-9865-y","type":"journal-article","created":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T15:07:14Z","timestamp":1427209634000},"page":"1720-1745","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Budget-constrained minimum cost flows"],"prefix":"10.1007","volume":"31","author":[{"given":"Michael","family":"Holzhauser","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Clemens","family":"Thielen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,25]]},"reference":[{"key":"9865_CR1","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice Hall, Network Flows"},{"issue":"2","key":"9865_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.3230250207","volume":"25","author":"RK Ahuja","year":"1995","unstructured":"Ahuja RK, Orlin JB (1995) A capacity scaling algorithm for the constrained maximum flow problem. Networks 25(2):89\u201398","journal-title":"Networks"},{"key":"9865_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","volume":"10","author":"WW Bein","year":"1985","unstructured":"Bein WW, Brucker P, Tamir A (1985) Minimum cost flow algorithms for series-parallel networks. Discret Appl Math 10:117\u2013124","journal-title":"Discret Appl Math"},{"key":"9865_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1006\/jagm.1993.1048","volume":"15","author":"H Booth","year":"1992","unstructured":"Booth H, Tarjan RE (1992) Finding the minimum-cost maximum flow in a series-parallel network. J Algorithms 15:416\u2013446","journal-title":"J Algorithms"},{"issue":"1","key":"9865_CR5","first-page":"31","volume":"37","author":"RE Burkard","year":"1993","unstructured":"Burkard RE, Dlaska K, Klinz B (1993) The quickest flow problem. Z f\u00fcr Oper Res 37(1):31\u201358","journal-title":"Z f\u00fcr Oper Res"},{"key":"9865_CR6","series-title":"Dover books on engineering series","volume-title":"Multiobjective decision making: theory and methodology","author":"V Chankong","year":"2008","unstructured":"Chankong V, Haimes YY (2008) Multiobjective decision making: theory and methodology., Dover books on engineering seriesDover Publications, Incorporated, New York"},{"issue":"2","key":"9865_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0377-2217(01)00208-9","volume":"137","author":"I Demgensky","year":"2002","unstructured":"Demgensky I, Noltemeier H, Wirth HC (2002) On the flow cost lowering problem. Eur J Operat Res 137(2):265\u2013271","journal-title":"Eur J Operat Res"},{"issue":"4","key":"9865_CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.jda.2004.04.003","volume":"2","author":"I Demgensky","year":"2004","unstructured":"Demgensky I, Noltemeier H, Wirth HC (2004) Optimizing cost flows by edge cost and capacity upgrade. J Discret Algorithms 2(4):407\u2013423","journal-title":"J Discret Algorithms"},{"issue":"3","key":"9865_CR9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.ejor.2012.09.005","volume":"224","author":"PA Maya Duque","year":"2013","unstructured":"Maya Duque PA, Coene S, Goos P, S\u00f6rensen K, Spieksma F (2013) The accessibility arc upgrading problem. Eur J Operat Res 224(3):458\u2013465","journal-title":"Eur J Operat Res"},{"key":"9865_CR10","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"9865_CR11","volume-title":"Computers and intractability\u2014a guide to the theory of $${\\cal NP}$$ NP","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014a guide to the theory of $${\\cal NP}$$ NP -completeness. W.H. Freeman and Company, New York"},{"issue":"1","key":"9865_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/opre.15.1.39","volume":"15","author":"AM Geoffrion","year":"1967","unstructured":"Geoffrion AM (1967) Solving bicriterion mathematical programs. Operat Res 15(1):39\u201354","journal-title":"Operat Res"},{"key":"9865_CR13","doi-asserted-by":"crossref","unstructured":"Han Y, Pan V, Reif J (1992) Efficient parallel algorithms for computing all pair shortest paths in directed graphs. In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, ACM, pp. 353\u2013362","DOI":"10.1145\/140901.141913"},{"issue":"3","key":"9865_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"DS Hochbaum","year":"1989","unstructured":"Hochbaum DS, Segev A (1989) Analysis of a flow problem with fixed charges. Networks 19(3):291\u2013312","journal-title":"Networks"},{"key":"9865_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"6","key":"9865_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0020-0190(98)00070-2","volume":"66","author":"SO Krumke","year":"1998","unstructured":"Krumke SO, Schwarz S (1998) On budget-constrained flow improvement. Inf Process Lett 66(6):291\u2013297","journal-title":"Inf Process Lett"},{"issue":"3","key":"9865_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1009798010579","volume":"2","author":"SO Krumke","year":"1998","unstructured":"Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS (1998) Approximation algorithms for certain network improvement problems. J Comb Optim 2(3):257\u2013288","journal-title":"J Comb Optim"},{"issue":"4","key":"9865_CR18","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Operat Res 4(4):414\u2013424","journal-title":"Math Operat Res"},{"issue":"4","key":"9865_CR19","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Applying parallel computation algorithms in the design of serial algorithms. JACM 30(4):852\u2013865","journal-title":"JACM"},{"key":"9865_CR20","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. Wiley, Chichester"},{"key":"9865_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/b15579","volume-title":"Handbook of water and wastewater treatment plant operations","author":"FR Spellman","year":"2013","unstructured":"Spellman FR (2013) Handbook of water and wastewater treatment plant operations, 3rd edn. Taylor & Francis, Boca Raton","edition":"3"},{"key":"9865_CR22","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes J, Tarjan RE, Lawler E (1982) The recognition of series parallel digraphs. SIAM J Comput 11:298\u2013313","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9865-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9865-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9865-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:26Z","timestamp":1559276606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9865-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,25]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9865"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9865-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,25]]}}}