{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:38:10Z","timestamp":1743151090162,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242632"},{"type":"electronic","value":"9783642242649"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24264-9_13","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T00:08:10Z","timestamp":1316822890000},"page":"170-182","source":"Crossref","is-referenced-by-count":4,"title":["The Maximum Flow Problem with Minimum Lot Sizes"],"prefix":"10.1007","author":[{"given":"Dag","family":"Haugland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mujahed","family":"Eleyat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1287\/opre.35.3.329","volume":"35","author":"H. Bahl","year":"1988","unstructured":"Bahl, H., Ritzman, L., Gupta, J.: Determining lot sizes and resource requirements: A review. Operations Research\u00a035(3), 329\u2013345 (1988)","journal-title":"Operations Research"},{"key":"13_CR2","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"13_CR3","first-page":"83","volume":"78","author":"D. Goldfarb","year":"1988","unstructured":"Goldfarb, D., Grigoriadis, M.: A computational comparison of the dinic and network simplex methods for maximum flow. Annals of Operations Research\u00a078, 83\u2013123 (1988)","journal-title":"Annals of Operations Research"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W. Hirsch","year":"1968","unstructured":"Hirsch, W., Dantzig, G.: The fixed charge problem. Naval Research Logistics Quarterly\u00a015, 413\u2013424 (1968)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1080\/00207540600902262","volume":"46","author":"R. Jans","year":"1968","unstructured":"Jans, R., Degraeve, Z.: Modeling industrial lot sizing problems: a review. International Journal of Production Research\u00a046(6), 1619\u20131643 (1968)","journal-title":"International Journal of Production Research"},{"key":"13_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72780-4","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2008","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (2008)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B. Karimi","year":"2003","unstructured":"Karimi, B., Ghomi, S.F., Wilson, J.: The capacitated lot sizing problem: a review of models and algorithms. Omega\u00a031, 365\u2013378 (2003)","journal-title":"Omega"},{"key":"13_CR8","unstructured":"http:\/\/www.miriam.as"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A. Nahapetyan","year":"2008","unstructured":"Nahapetyan, A., Pardalos, P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Computational Optimization and Applications\u00a039, 37\u201350 (2008)","journal-title":"Computational Optimization and Applications"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"Tardos, E.: A strongly polynomial minimum cost circulation algorithm. Combinatorica\u00a05, 247\u2013255 (1985)","journal-title":"Combinatorica"},{"key":"13_CR11","first-page":"8","volume-title":"Tutorials on Emerging Methodologies and Applications in Operations Research","author":"S. Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Woodruff, D.: Connecting mrp, MRP II and ERP supply chain production planning via optimization models. In: Greenberg, H. (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research, p. 8.1\u20138.30. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24264-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:09:32Z","timestamp":1558296572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24264-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242632","9783642242649"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24264-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}