{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T14:12:28Z","timestamp":1680444748684},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T00:00:00Z","timestamp":1181260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s10878-007-9080-6","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T14:51:56Z","timestamp":1181227916000},"page":"315-341","source":"Crossref","is-referenced-by-count":8,"title":["An efficient generalized network-simplex-based algorithm for manufacturing network flows"],"prefix":"10.1007","volume":"15","author":[{"given":"Prahalad","family":"Venkateshan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamlesh","family":"Mathur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald H.","family":"Ballou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,8]]},"reference":[{"key":"9080_CR1","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice-Hall, New Jersey"},{"key":"9080_CR2","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"1990","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (1990) Linear programming and network flows. Wiley, New York"},{"key":"9080_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/1055678031000152079","volume":"18","author":"SC Fang","year":"2003","unstructured":"Fang SC, Qi L (2003) Manufacturing network flows: a generalized network flow model for manufacturing process modeling. Optim Methods Softw 18:143\u2013165","journal-title":"Optim Methods Softw"},{"key":"9080_CR4","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"5","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM, Graves G (1974) Multicommodity distribution system design by Benders\u2019 decomposition. Manag Sci 5:822\u2013854","journal-title":"Manag Sci"},{"key":"9080_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/trsc.7.4.377","volume":"7","author":"F Glover","year":"1974","unstructured":"Glover F, Klingman D, Stulz J (1974) Extensions of the augmented predecessor index method to generalized network problems. Transp Sci 7:377\u2013384","journal-title":"Transp Sci"},{"key":"9080_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0305-0548(79)90010-8","volume":"6","author":"BL Golden","year":"1979","unstructured":"Golden BL, Liberatore M, Lieberman C (1979) Models and solution techniques for cash flow management. Comput Oper Res 6:13\u201320","journal-title":"Comput Oper Res"},{"key":"9080_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.14.4.619","volume":"14","author":"E Johnson","year":"1966","unstructured":"Johnson E (1966) Networks and basic solutions. Oper Res 14:89\u201395","journal-title":"Oper Res"},{"key":"9080_CR8","volume-title":"Algorithms for network programming","author":"JL Kennington","year":"1980","unstructured":"Kennington JL, Helgason RV (1980) Algorithms for network programming. Wiley, New York"},{"key":"9080_CR9","first-page":"351","volume":"11","author":"H Lu","year":"2006","unstructured":"Lu H, Yao E, Qi L (2006) Some further results on minimum distribution cost flow problems. J Comb Optim 11:351\u2013371","journal-title":"J Comb Optim"},{"key":"9080_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3934\/jimo.2005.1.251","volume":"1","author":"J Mo","year":"2005","unstructured":"Mo J, Qi L, Wei Z (2005) A network simplex algorithm for simple manufacturing network model. J Ind Manag Optim 1:251\u2013273","journal-title":"J Ind Manag Optim"},{"key":"9080_CR11","volume-title":"The vehicle routing problem","year":"2002","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9080-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9080-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9080-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9080-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,8]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9080"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9080-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,8]]}}}