Minimum cost flows over time without intermediate storage

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 66-75

  Fleischer, Lisa ^a   Skutella, Martin ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; ROUTERS;

INTERMEDIATE STORAGE;

TELECOMMUNICATION NETWORKS;

EID: 0037740579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. E. Aronson. A survey of dynamic network flows. Annals of Operations Research, 20:1-66, 1989.
2. L. Fleischer and M. Skutella. The quickest multicommodity flow problem. In W. J. Cook and A. S. Schulz, editors, Integer Programming and Combinatorial Optimization, number 2337 in Lecture Notes in Computer Science, pages 36-53. Springer-Verlag, 2002.
3. L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
4. D. Gale. Transient flows in networks. Michigan Mathematical Journal, 6:59-63, 1959.
5. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
6. A. Hall and M. Skutella. Personal communication, 2002.
7. B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
8. B. Hoppe and É. Tardos. Polynomial time algorithms for some evacuation problems. In Proc. of 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 433-441, 1994.
9. B. Hoppe and É. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36-62, 2000.
10. 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, number 920 in Lecture Notes in Computer Science, pages 329-343. Springer-Verlag, 1995.
11. E. Minieka. Maximal, lexicographic, and dynamic network flows. Operations Research, 21:517-527, 1973.
12. J. B. Orlin. Minimum convex cost dynamic network flows. Mathematics of Operations Research, 9:190-207, 1984.
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, Handbooks in Operations Research and Management Science: Networks. Elsevier Science Publishers B. V., 1995.
14. W. L. Wilkinson. An algorithm for universal maximal dynamic flows in a network. Operations Research, 19:1602-1612, 1971.
15. N. Zadeh. A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming, 5:255-266, 1973.