Multicommodity flows over time: Efficient algorithms and complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 397-409

  Hall, Alex ^a   Hippler, Steffen ^b   Skutella, Martin ^c  

^a ETH ZURICH   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Complexity; Dynamic flow; Efficient algorithm; Flow over time; Network flow; Routing

Indexed keywords

AIR TRAFFIC CONTROL; ALGORITHMS; COMPUTATIONAL COMPLEXITY;

COMPLEXITY; DYNAMIC FLOWS; FLOW OVER TIME; NETWORK FLOWS; ROUTING;

COMPLEX NETWORKS;

EID: 35248865677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_33     Document Type: Article

References (13)

1. J. E. Aronson. A survey of dynamic network flows. Annals of Operations Research, 20:1-66, 1989.
2. R. E. Burkard, K. Dlaska, and B. Klinz. The quickest flow problem. ZOR - Methods and Models of Operations Research, 37:31-58, 1993.
3. T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In Proceedings of the 30th Hawaii International Conference on System Sciences, pages 221-222. IEEE Computer Society Press, 1997.
4. L. Fleischer and M. Skutella. The quickest multicommodity flow problem. In W. J. Cook and A. S. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 36-53. Springer, Berlin, 2002.
5. L. Fleischer and M. Skutella. Minimum cost flows over time without intermediate storage. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 66-75, Baltimore, MD, 2003.
6. L. K. Fleischer and É. Tardos. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23:71-80, 1998.
7. L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
8. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
9. B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995.
10. B. Hoppe and É. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36-62, 2000.
11. 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-343. Springer, Berlin, 1995.
12. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4:414-424, 1979.
13. 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-295. North-Holland, Amsterdam, The Netherlands, 1995.