{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T19:54:22Z","timestamp":1659383662786},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540436768","type":"print"},{"value":"9783540478676","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_4","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:47:17Z","timestamp":1179931637000},"page":"36-53","source":"Crossref","is-referenced-by-count":33,"title":["The Quickest Multicommodity Flow Problem"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Fleischer","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J. E. Aronson","year":"1989","unstructured":"J. E. Aronson. A survey of dynamic network flows. Annals of Operations Research, 20:1\u201366, 1989.","journal-title":"Annals of Operations Research"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"R. E. Burkard","year":"1993","unstructured":"R. E. Burkard, K. Dlaska, and B. Klinz. The quickest flow problem. ZOR-Methods and Models of Operations Research, 37:31\u201358, 1993.","journal-title":"ZOR-Methods and Models of Operations Research"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L. K. Fleischer","year":"2000","unstructured":"L. K. Fleischer. Approximating fractional multicommodity flows independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13:505\u2013520, 2000.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L. K. Fleischer","year":"1998","unstructured":"L. K. Fleischer and \u00c9 Tardos. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23:71\u201380, 1998.","journal-title":"Operations Research Letters"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L. R. Ford","year":"1958","unstructured":"L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419\u2013433, 1958.","journal-title":"Operations Research"},{"key":"4_CR6","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"D. Gale. Transient flows in networks. Michigan Mathematical Journal, 6:59\u201363, 1959.","journal-title":"Michigan Mathematical Journal"},{"key":"4_CR8","unstructured":"N. Garg and J. K\u00f6nemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300\u2013309, Palo Alto, CA, 1998."},{"key":"4_CR9","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"G. Handler and I. Zang. A dual algorithm for the constrained shortest path problem. Networks, 10:293\u2013310, 1980.","journal-title":"Networks"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17:36\u201342, 1992.","journal-title":"Mathematics of Operations Research"},{"key":"4_CR12","unstructured":"B. Hoppe and \u00c9 Tardos. Polynomial time algorithms for some evacuation problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 433\u2013441, Arlington, VA, 1994."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"B. Hoppe and \u00c9 Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36\u201362, 2000.","journal-title":"Mathematics of Operations Research"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-59408-6_62","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Klinz","year":"1995","unstructured":"B. Klinz and G. J. Woeginger. Minimum cost dynamic flows: The series-parallel case. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, volume 920 of Lecture Notes in Computer Science, pages 329\u2013343. Springer, Berlin, 1995."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D. H. Lorenz","year":"2001","unstructured":"D. H. Lorenz and D. Raz. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters, 28:213\u2013219, 2001.","journal-title":"Operations Research Letters"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"E. Minieka. Maximal, lexicographic, and dynamic network flows. Operations Research, 21:517\u2013527, 1973.","journal-title":"Operations Research"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"C. A. Phillips. The network inhibition problem. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 776\u2013785, San Diego, CA, 1993.","DOI":"10.1145\/167088.167286"},{"key":"4_CR18","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing","author":"W. B. Powell","year":"1995","unstructured":"W. B. Powell, P. Jaillet, and A. Odoni. Stochastic and dynamic networks and routing. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, chapter 3, pages 141\u2013295. North-Holland, Amsterdam, The Netherlands, 1995."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W. L. Wilkinson","year":"1971","unstructured":"W. L. Wilkinson. An algorithm for universal maximal dynamic flows in a network. Operations Research, 19:1602\u20131612, 1971.","journal-title":"Operations Research"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:49:25Z","timestamp":1550335765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-47867-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2002]]}}}