{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:33:21Z","timestamp":1773088401734,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330896","type":"print"},{"value":"9783642330902","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_47","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"539-550","source":"Crossref","is-referenced-by-count":6,"title":["Maximum Multicommodity Flows over Time without Intermediate Storage"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gro\u00df","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research\u00a020, 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"47_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/TITS.2009.2026443","volume":"10","author":"M. Braun","year":"2009","unstructured":"Braun, M., Winter, S.: Ad hoc solution of the multicommodity-flow-over-time problem. IEEE Transactions on Intelligent Transportation Systems\u00a010(4), 658\u2013667 (2009)","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"47_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"R.E. Burkard","year":"1993","unstructured":"Burkard, R.E., Dlaska, K., Klinz, B.: The quickest flow problem. ZOR \u2013 Methods and Models of Operations Research\u00a037, 31\u201358 (1993)","journal-title":"ZOR \u2013 Methods and Models of Operations Research"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-47867-1_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Fleischer","year":"2002","unstructured":"Fleischer, L., Skutella, M.: The Quickest Multicommodity Flow Problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 36\u201353. Springer, Heidelberg (2002)"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L.K. Fleischer","year":"1998","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters\u00a023, 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1987","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1987)","journal-title":"Operations Research"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"A. Hall","year":"2007","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science\u00a0379, 387\u2013404 (2007)","journal-title":"Theoretical Computer Science"},{"key":"47_CR11","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. PhD thesis, Cornell University (1995)"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/net.10112","volume":"43","author":"B. Klinz","year":"2004","unstructured":"Klinz, B., Woeginger, G.J.: Minimum cost dynamic flows: The series parallel case. Networks\u00a043, 153\u2013162 (2004)","journal-title":"Networks"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research\u00a04, 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"47_CR15","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":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, ch.\u00a03, vol. 8, pp. 141\u2013295. North\u2013Holland, Amsterdam (1995)"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_21"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:59Z","timestamp":1620129299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}