{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:30:03Z","timestamp":1776213003417,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540767954","type":"print"},{"value":"9783540767961","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76796-1_21","type":"book-chapter","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T07:24:04Z","timestamp":1225956244000},"page":"451-482","source":"Crossref","is-referenced-by-count":124,"title":["An Introduction to Network Flows over Time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Skutella","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"21_CR2","volume-title":"Linear Programming in Infinite-Dimensional Spaces","author":"E.J. Anderson","year":"1987","unstructured":"Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces. Wiley, New York (1987)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1287\/moor.7.4.501","volume":"7","author":"E.J. Anderson","year":"1982","unstructured":"Anderson, E.J., Nash, P., Philpott, A.B.: A class of continuous network flow problems. Math. Oper. Res. 7, 501\u2013514 (1982)","journal-title":"Math. Oper. Res."},{"key":"21_CR4","first-page":"369","volume-title":"Probability, Statistics and Optimisation","author":"E.J. Anderson","year":"1994","unstructured":"Anderson, E.J., Philpott, A.B.: Optimisation of flows in networks over time. In: Kelly, F.P. (ed.) Probability, Statistics and Optimisation, pp. 369\u2013382. Wiley, New York (1994)"},{"key":"21_CR5","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. Ann. Oper. Res. 20, 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Baumann, N., Skutella, M.: Solving evacuation problems efficiently: Earliest arrival flows with multiple sources. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, pp. 399\u2013408 (2006)","DOI":"10.1109\/FOCS.2006.70"},{"key":"21_CR7","unstructured":"Berlin, G.N.: The use of directed routes for assessing escape potential. National Fire Protection Association, Boston,\u00a0MA (1979)"},{"key":"21_CR8","doi-asserted-by":"publisher","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, Z. Oper.-Res. 37, 31\u201358 (1993).","journal-title":"ZOR, Z. Oper.-Res."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.28.1.86","volume":"28","author":"L.G. Chalmet","year":"1982","unstructured":"Chalmet, L.G., Francis, R.L., Saunders, P.B.: Network models for building evacuation. Manage. Sci. 28, 86\u2013105 (1982)","journal-title":"Manage. Sci."},{"key":"21_CR10","unstructured":"Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 66\u201375 (2003)"},{"key":"21_CR11","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 J. Comput. 36, 1600\u20131630 (2007)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S1052623497327295","volume":"12","author":"L.K. Fleischer","year":"2001","unstructured":"Fleischer, L.K.: Faster algorithms for the quickest transshipment problem. SIAM J. Optim. 12, 18\u201335 (2001)","journal-title":"SIAM J. Optim."},{"key":"21_CR13","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, E.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23, 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"21_CR15","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Mich. Math. J. 6, 59\u201363 (1959)","journal-title":"Mich. Math. J."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/net.3230140308","volume":"14","author":"B. Hajek","year":"1984","unstructured":"Hajek, B., Ogier, R.G.: Optimal dynamic routing in communication networks with continuous traffic. Networks 14, 457\u2013487 (1984)","journal-title":"Networks"},{"key":"21_CR18","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. Theor. Comput. Sci. 379, 387\u2013404 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9","volume":"34","author":"H.W. Hamacher","year":"1987","unstructured":"Hamacher, H.W., Tufecki, S.: On the use of lexicographic min cost flows in evacuation modeling. Nav. Res. Logist. 34, 487\u2013503 (1987)","journal-title":"Nav. Res. Logist."},{"key":"21_CR20","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. PhD thesis, Cornell University (1995)"},{"key":"21_CR21","unstructured":"Hoppe, B., Tardos, E.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Arlington, VA, pp. 433\u2013441 (1994)"},{"key":"21_CR22","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, E.: The quickest transshipment problem. Math. Oper. Res. 25, 36\u201362 (2000)","journal-title":"Math. Oper. Res."},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"J. Jarvis","year":"1982","unstructured":"Jarvis, J., Ratliff, H.: Some equivalent objectives for dynamic network flow problems. Manage. Sci. 28, 106\u2013108 (1982)","journal-title":"Manage. Sci."},{"key":"21_CR24","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 43, 153\u2013162 (2004)","journal-title":"Networks"},{"key":"21_CR25","volume-title":"Combinatorial Optimization: Theory and Algorithms, 4th edn.","author":"B. Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)"},{"key":"21_CR26","unstructured":"Kotnyek, B.: An annotated overview of dynamic network flows. Rapport de recherche 4936, INRIA Sophia Antipolis (2003)"},{"key":"21_CR27","first-page":"1417","volume":"48","author":"S.E. Lovetskii","year":"1987","unstructured":"Lovetskii, S.E., Melamed, I.I.: Dynamic network flows. Autom. Remote Control 48, 1417\u20131434 (1987). Translated from Avtomatika i Telemekhanika 11, 7\u201329 (1987)","journal-title":"Autom. Remote Control"},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-32539-5_47","volume-title":"Operations Research Proceedings 2005","author":"M. Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Haasis, H.-D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operations Research Proceedings 2005, pp. 297\u2013302. Springer, Berlin (2006)"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N. Megiddo","year":"1974","unstructured":"Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7, 97\u2013107 (1974)","journal-title":"Math. Program."},{"key":"21_CR30","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. Math. Oper. Res. 4, 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"key":"21_CR31","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Oper. Res. 21, 517\u2013527 (1973)","journal-title":"Oper. Res."},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.15.4.640","volume":"15","author":"A.B. Philpott","year":"1990","unstructured":"Philpott, A.B.: Continuous-time flows in networks. Math. Oper. Res. 15, 640\u2013661 (1990)","journal-title":"Math. Oper. Res."},{"key":"21_CR33","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","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, vol. 8, Chap. 3, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"21_CR34","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"21_CR35","unstructured":"Tjandra, S.: Dynamic network optimization with application to the evacuation problem. PhD thesis, Universit\u00e4t Kaiserslautern, Shaker Verlag, Aachen (2003)"},{"key":"21_CR36","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W.L. Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19, 1602\u20131612 (1971)","journal-title":"Oper. Res."},{"key":"21_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01580132","volume":"5","author":"N. Zadeh","year":"1973","unstructured":"Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Program. 5, 255\u2013266 (1973)","journal-title":"Math. Program."}],"container-title":["Research Trends in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76796-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:39:00Z","timestamp":1619519940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76796-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540767954","9783540767961"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21","relation":{},"subject":[]}}