An FPTAS for quickest multicommodity flows with inflow-dependent transit times

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

Volumn 2764, Issue , 2003, Pages 71-82

  Hall, Alex ^a   Langkau, Katharina ^b   Skutella, Martin ^c  

^a ETH ZURICH   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

APPROXIMATION RESULTS; CURRENT FLOWS; FLOW PROBLEMS; MULTI-COMMODITY FLOW; MULTICOMMODITY FLOW PROBLEMS; NON-DECREASING FUNCTIONS; PRODUCTION SYSTEM; ROAD TRAFFIC;

APPROXIMATION ALGORITHMS;

EID: 27844461682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_7     Document Type: Article

References (17)

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. M. Carey and E. Subrahmanian. An approach to modelling time-varying flows on congested networks. Transportation Research B, 34:157-183, 2000.
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. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
7. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
8. A. Hall, S. Hippler, and M. Skutella. Multicommodity flows over time: Efficient algorithms and complexity. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), Eindhoven, The Netherlands, 2003. To appear.
9. G. Handler and I. Zang. A dual algorithm for the constrained shortest path problem. Networks, 10:293-310, 1980.
10. B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995.
11. B. Hoppe and É. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36-62, 2000.
12. 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.
13. E. Köhler, K. Langkau, and M. Skutella. Time-expanded graphs for flow-dependent transit times. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pages 599-611. Springer, Berlin, 2002.
14. E. Köhler and M. Skutella. Flows over time with load-dependent transit times. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 174-183, San Francisco, CA, 2002.
15. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4:414-424, 1979.
16. 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.
17. B. Ran and D. E. Boyce. Modelling Dynamic Transportation Networks. Springer, Berlin, 1996.