{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:22:42Z","timestamp":1743142962904,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642292095"},{"type":"electronic","value":"9783642292101"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29210-1_14","type":"book-chapter","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T14:47:55Z","timestamp":1338994075000},"page":"83-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel algorithms for the maximum flow problem with minimum lot sizes"],"prefix":"10.1007","author":[{"given":"Mujahed","family":"Eleyat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dag","family":"Haugland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Natvig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,14]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Setubal, J.C.: On the parallel implementation of Goldberg\u2019s maximum flow algorithm. In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, SPAA\u201992, pp. 168-177, ACM (1992)","DOI":"10.1145\/140901.140919"},{"key":"14_CR2","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM. 35, 921\u2013940 (1988)","journal-title":"J. ACM."},{"key":"14_CR4","first-page":"83","volume":"78","author":"D Goldfarb","year":"1988","unstructured":"Goldfarb, D., Grigoriadis, M.D.: A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Operations Research. 78, 83\u2013123 (1988)","journal-title":"Annals of Operations Research."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995)","DOI":"10.1093\/oso\/9780195085914.001.0001"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Haugland, D., Eleyat, M., Hetland, M.L.: The maximum flow problem with minimum lot sizes. In: Proceedings of the Second international conference on Computational logistics, ICCL\u201911, pp. 170-182. Springer-Verlag (2011)","DOI":"10.1007\/978-3-642-24264-9_13"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/TPDS.2010.156","volume":"22","author":"B Hong","year":"2011","unstructured":"Hong, B., He, Z.: An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic. IEEE Trans. Parallel Distrib. Syst. 22, 1025\u20131033 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR8","volume-title":"Graphs","author":"D Jungnickel","year":"2008","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms. Springer (2008)"},{"key":"14_CR9","first-page":"434","volume":"15","author":"AV Karzanov","year":"1975","unstructured":"Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, 434\u2013437 (1975)","journal-title":"Soviet Math. Dokl."},{"key":"14_CR10","unstructured":"Parmar, P.: Integer Programming Approaches for Equal-Split Network Flow Problems. PhD thesis, Georgia Institute of Technology (2007)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach, Y., Vishkin, U.: An O(n2 logn) parallel max-flow algorithm. Journal of Algorithms. 3, 128\u2013146 (1982)","journal-title":"Journal of Algorithms."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29210-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T21:52:56Z","timestamp":1676152376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29210-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642292095","9783642292101"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29210-1_14","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"14 April 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}