Universally maximum flow with piecewise-constant capacities

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

Volumn 1610, Issue , 1999, Pages 151-165

  Fleischer, Lisa ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

DYNAMIC FLOWS; MAXIMUM FLOW PROBLEMS; MAXIMUM FLOWS; NODE CAPACITY; PIECE-WISE CONSTANTS; PIECE-WISE-CONSTANT FUNCTIONS; SOURCE TO SINKS; TIME INTERVAL;

INTEGER PROGRAMMING;

EID: 35048904626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_12     Document Type: Conference Paper

References (24)

1. E. J. Anderson and P. Nash. Linear Programming in Infinite-Dimensional Spaces. John Wiley & Sons, 1987.
2. E. J. Anderson, P. Nash, and A. B. Philpott. A class of continuous network flow problems. Ma them a tics of Operations Research, 7:501-14, 1982.
3. E. J. Anderson and A. B. Philpott. A continuous-time network simplex algorithm. Networks, 19:395-425, 1989.
4. J. E. Aronson. A survey of dynamic network flows. Annals of Operations Research, 20:1-66, 1989.
5. R. E. Burkard, K. Dlaska, and B. Klinz. The quickest flow problem. ZOR Methods and Models of Operations Research, 37(1):31-58, 1993.
6. L. Fleischer. Faster algorithms for the quickest transshipment problem with zero transit times. In Proceedings of the Ninth Annual ACM/SIAM Symposium on Discrete Algorithms, pages 147-156, 1998. Submitted to SIAM Journal on Optimization.
7. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
8. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18(1):30-55, 1989.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of ACM, 35:921-940, 1988.
10. B. Hajek and R. G. Ogier. Optimal dynamic routing in communication networks with continuous traffic. Networks, 14:457-487, 1984.
11. B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
12. 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.
13. B. Hoppe and E. Tardos. The quickest transshipment problem. In Proc. of 6th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 512-521, 1995.
14. E. Minieka. Maximal, lexicographic, and dynamic network flows. Operations Research, 21:517-527, 1973.
15. F. H. Moss and A. Segall. An optimal control approach to dynamic routing in networks. IEEE Transactions on Automatic Control, 27(2):329-339, 1982.
16. R. G. Ogier. Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities. Networks, 18:303-318, 1988.
17. J. B. Orlin. Minimum convex cost dynamic network flows. Mathematics of Operations Research, 9(2):190-207, 1984.
18. A. B. Philpott. Continuous-time flows in networks. Ma them a tics of Operations Research, 15(4):640-661, November 1990.
19. A. B. Philpott and M. Craddock. An adaptive discretization method for a class of continuous network programs. Networks, 26:1-11, 1995.
20. 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.
21. M. C. Pullan. An algorithm for a class of continuous linear programs. SIAM J. Control and Optimization, 31 (6): 1558-1577, November 1993.
22. M. C. Pullan. A study of general dynamic network programs with arc time-delays. SIAM Journal on Optimization, 7:889-912, 1997.
23. G. I. Stassinopoulos and P. Konstantopoulos. Optimal congestion control in single destination networks. IEEE transactions on communications, 33(8):792-800, 1985.
24. W. L. Wilkinson. An algorithm for universal maximal dynamic flows in a network. Operations Research, 19:1602-1612, 1971.