An introduction to network flows over time

Research Trends in Combinatorial Optimization: Bonn 2008

Volumn , Issue , 2009, Pages 451-482

  Skutella, Martin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 64849097179     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-76796-1_21     Document Type: Chapter

References (38)

1. Ahuja, R. K., Magnanti, T. L., Orlin, J. B.: Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Anderson, E. J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces. Wiley, New York (1987)
3. Anderson, E. J., Nash, P., Philpott, A. B.: A class of continuous network flow problems. Math. Oper. Res. 7, 501-514 (1982)
4. Anderson, E. J., Philpott, A. B.: Optimisation of flows in networks over time. In: Kelly, F. P. (ed.) Probability, Statistics and Optimisation, pp. 369-382. Wiley, New York (1994)
5. Aronson, J. E.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1-66 (1989)
6. 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-408 (2006)
7. Berlin, G. N.: The use of directed routes for assessing escape potential. National Fire Protection Association, Boston, MA (1979)
8. Burkard, R. E., Dlaska, K., Klinz, B.: The quickest flow problem. ZOR, Z. Oper.-Res. 37, 31-58 (1993).
9. Chalmet, L. G., Francis, R. L., Saunders, P. B.: Network models for building evacuation. Manage. Sci. 28, 86-105 (1982)
10. Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 66-75 (2003)
11. Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36, 1600-1630 (2007)
12. Fleischer, L. K.: Faster algorithms for the quickest transshipment problem. SIAM J. Optim. 12, 18-35 (2001)
13. Fleischer, L. K., Tardos, E.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23, 71-80 (1998)
14. Ford, L. R., Fulkerson, D. R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419-433 (1958)
15. Ford, L. R., Fulkerson, D. R.: Flows in Networks. Princeton University Press, Princeton (1962)
16. Gale, D.: Transient flows in networks. Mich. Math. J. 6, 59-63 (1959)
17. Hajek, B., Ogier, R. G.: Optimal dynamic routing in communication networks with continuous traffic. Networks 14, 457-487 (1984)
18. Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379, 387-404 (2007)
19. Hamacher, H. W., Tufecki, S.: On the use of lexicographic min cost flows in evacuation modeling. Nav. Res. Logist. 34, 487-503 (1987)
20. Hoppe, B.: Efficient dynamic network flow algorithms. PhD thesis, Cornell University (1995)
21. Hoppe, B., Tardos, E.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, A rlington, VA, pp. 433-441 (1994)
22. Hoppe, B., Tardos, E.: The quickest transshipment problem. Math. Oper. Res. 25, 36-62 (2000)
23. Jarvis, J., Ratliff, H.: Some equivalent objectives for dynamic network flow problems. Manage. Sci. 28, 106-108 (1982)
24. Klinz, B., Woeginger, G. J.: Minimum-cost dynamic flows: The series-parallel case. Networks 43, 153-162 (2004)
25. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)
26. Kotnyek, B.: An annotated overview of dynamic network flows. Rapport de recherche 4936, INRIA Sophia Antipolis (2003)
27. Lovetskii, S. E., Melamed, I. I.: Dynamic network flows. Autom. Remote Control 48, 1417-1434 (1987).
28. Translated from Avtomatika i Telemekhanika 11, 7-29 (1987)
29. Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Haasis, H.-D., Kopfer, H., Schönberger, J. (eds.) Operations Research Proceedings 2005, pp. 297-302. Springer, Berlin (2006)
30. Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7, 97-107 (1974)
31. Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414-424 (1979)
32. Minieka, E.: Maximal, lexicographic, and dynamic network flows. Oper. Res. 21, 517-527 (1973)
33. Philpott, A. B.: Continuous-time flows in networks. Math. Oper. Res. 15, 640-661 (1990)
34. 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-295. North-Holland, Amsterdam (1995)
35. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
36. Tjandra, S.: Dynamic network optimization with application to the evacuation problem. PhD thesis, Universität Kaiserslautern, Shaker Verlag, Aachen (2003)
37. Wilkinson, W. L.: An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19, 1602-1612 (1971)
38. Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Program. 5, 255-266 (1973)