{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T17:18:57Z","timestamp":1712596737627},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T00:00:00Z","timestamp":1463788800000},"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":[[2017,5]]},"DOI":"10.1007\/s10878-016-0031-y","type":"journal-article","created":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T22:40:27Z","timestamp":1464043227000},"page":"1226-1256","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Maximum flows in generalized processing networks"],"prefix":"10.1007","volume":"33","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":[[2016,5,21]]},"reference":[{"key":"31_CR1","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice Hall, Englewood Cliffs"},{"key":"31_CR2","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"},{"issue":"1","key":"31_CR3","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/62038.62041","volume":"15","author":"MD Chang","year":"1989","unstructured":"Chang MD, Chen CJ, Engquist M (1989) An improved primal simplex variant for pure processing networks. ACM Trans Math Softw 15(1):64\u201378","journal-title":"ACM Trans Math Softw"},{"issue":"12","key":"31_CR4","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1287\/mnsc.32.12.1582","volume":"32","author":"CJ Chen","year":"1986","unstructured":"Chen CJ, Engquist M (1986) A primal simplex approach to pure processing networks. Manag Sci 32(12):1582\u20131598","journal-title":"Manag Sci"},{"key":"31_CR5","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge","edition":"3"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/1055678031000152079","volume":"18","author":"S-C Fang","year":"2003","unstructured":"Fang S-C, Qi L (2003) Manufacturing network flows: a generalized network flow model for manufacturing process modelling. Optim Methods Softw 18:143\u2013165","journal-title":"Optim Methods Softw"},{"key":"31_CR7","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":"2","key":"31_CR8","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N Garg","year":"2007","unstructured":"Garg N, Koenemann J (2007) Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J Comput 37(2):630\u2013652","journal-title":"SIAM J Comput"},{"key":"31_CR9","volume-title":"Maximum flow problem in assembly manufacturing networks","author":"K Huang","year":"2011","unstructured":"Huang K (2011) Maximum flow problem in assembly manufacturing networks. North Carolina State University, Raleigh"},{"key":"31_CR10","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"},{"key":"31_CR11","volume-title":"Maximal flow through a processing network with the source as the only processing node","author":"J Koene","year":"1980","unstructured":"Koene J (1980) Maximal flow through a processing network with the source as the only processing node. Universiteitsdrukkerij TU Eindhoven, Eindhoven"},{"key":"31_CR12","unstructured":"Koene J (1982) Minimal cost flow in processing networks: a primal approach. PhD thesis, Mathematisch Centrum"},{"key":"31_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial optimization","author":"B Korte","year":"2002","unstructured":"Korte B, Vygen J (2002) Combinatorial optimization. Springer, Berlin"},{"issue":"4","key":"31_CR14","first-page":"351","volume":"11","author":"H-Y Lu","year":"2006","unstructured":"Lu H-Y, Yao E-Y, Qi L (2006) Some further results on minimum distribution cost flow problems. J Comb Optim 11(4):351\u2013371","journal-title":"J Comb Optim"},{"issue":"1","key":"31_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10255-005-5157-7","volume":"25","author":"H-Y Lu","year":"2009","unstructured":"Lu H-Y, Yao E-Y, Zhang B-W (2009) A note on a generalized network flow model for manufacturing process. Acta Math Appl Sin 25(1):51\u201360","journal-title":"Acta Math Appl Sin"},{"key":"31_CR16","volume-title":"Netze mit Verteilungsfaktoren","author":"A Schaefer","year":"1978","unstructured":"Schaefer A (1978) Netze mit Verteilungsfaktoren. Hain, Meisenheim am Glan"},{"key":"31_CR17","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"},{"issue":"3","key":"31_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.3934\/jimo.2006.2.237","volume":"2","author":"RL Sheu","year":"2006","unstructured":"Sheu RL, Tin MJ, Wang IL (2006) Maximum flow problem in the distribution network. J Ind Manag Optim 2(3):237","journal-title":"J Ind Manag Optim"},{"key":"31_CR19","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"},{"issue":"4","key":"31_CR20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10878-007-9080-6","volume":"15","author":"P Venkateshan","year":"2008","unstructured":"Venkateshan P, Mathur K, Ballou RH (2008) An efficient generalized network-simplex-based algorithm for manufacturing network flows. J Comb Optim 15(4):315\u2013341","journal-title":"J Comb Optim"},{"key":"31_CR21","doi-asserted-by":"crossref","first-page":"929","DOI":"10.3934\/jimo.2009.5.929","volume":"5","author":"IL Wang","year":"2009","unstructured":"Wang IL, Lin SJ (2009) A network simplex algorithm for solving the minimum distribution cost problem. J Ind Manag Optim 5:929\u2013950","journal-title":"J Ind Manag Optim"},{"key":"31_CR22","unstructured":"Wayne KD (1999) Generalized maximum flow algorithms. PhD thesis, Cornell University"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0031-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0031-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0031-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0031-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:29Z","timestamp":1559262209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0031-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,21]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0031-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,21]]}}}