Universally maximum flow with piecewise-constant capacities

Networks

Volumn 38, Issue 3, 2001, Pages 115-125

  Fleischer, Lisa K ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Dynamic flow; Parametric flow; Transshipment

Indexed keywords

EID: 0035486116     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.1030     Document Type: Article

References (30)

1. [1] E.J. Anderson and P. Nash, Linear programming in infinite-dimensional spaces, Wiley, New York, 1987.
2. [2] E.J. Anderson, P. Nash, and A.B. Philpott, A class of continuous network flow problems. Math Oper Res 7 (1982), 501-514.
3. [3] E.J. Anderson and A.B. Philpott, A continuous-time network simplex algorithm, Networks 19 (1989), 395-425.
4. [4] J.E. Aronson, A survey of dynamic network flows, Ann Oper Res 20 (1989), 1-66.
5. [5] R.E. Burkard, K. Dlaska, and B. Klinz, The quickest flow problem, ZOR Methods Models Oper Res 37 (1993), 31-58.
6. [6] L. Fleischer, Faster algorithms for the quickest transshipment problem, SIAM J Option 12 (2001), 18-35 (extended abstract appeared in Proc SODA 1998).
7. [7] L. Fleischer and É. Tardos, Efficient continuous-time dynamic network flow algorithms, Oper Res Lett 23 (1998), 71-80.
8. [8] L.R. Ford and D.R. Fulkerson. Flows in networks, Princeton University Press, Princeton, NJ, 1962.
9. [9] G. Gallo, M.D. Grigoriadis, and R.E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J Comput 18 (1989), 30-55.
10. [10] A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, J ACM 35 (1988), 921-940.
11. [11] D. Gusfield and C. Martel, A fast algorithm for the generalized parametric minimum cut problem and applications, Algorithmica 7 (1992), 499-519.
12. [12] B. Hajek and R.G. Ogier, Optimal dynamic routing in communication networks with continuous traffic, Networks 14 (1984), 457-487.
13. [13] D.S. Hochbaum and S.P. Hong, About strongly polynomial time algorithms for quadratic optimization over submodular constraints, Math Program 69 (1995), 269-309.
14. [14] B. Hoppe, Efficient dynamic network flow algorithms, PhD Thesis, Cornell University, June 1995, Department of Computer Science Technical Report TR95-1524.
15. [15] B. Hoppe and É. Tardos, Polynomial time algorithms for some evacuation problems, Proc 5th Annual ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 433-441.
16. [16] B. Hoppe and É. Tardos, The quickest transshipment problem, Math Oper Res 25 (2000), 36-62 (extended abstract appeared in Proc SODA 1995).
17. [17] B. Klinz and G.J. Woeginger, "Minimum cost dynamic flows: The series-parallel case," Integer programming and combinatorial optimization, E. Balas and J. Clausen (Editors), Proc 4th Int IPCO Conf, Lecture Notes in Computer Science 920, Springer-Verlag, 1995, pp. 329-343.
18. [18] S.T. McCormick, Fast algorithms for parametric scheduling come from extensions to parametric maximum flow, Oper Res 47 (1999), 744-756 (extended abstract appeared in Proc STOC 96).
19. [19] E. Minieka, Maximal, lexicographic, and dynamic network flows, Oper Res 21 (1973), 517-527.
20. [20] F.H. Moss and A. Segall, An optimal control approach to dynamic routing in networks, IEEE Trans Autom Control 27 (1982), 329-339.
21. [21 ] R.G. Ogier, Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities, Networks 18 (1988), 303-318.
22. [22] J.B. Orlin, Maximum-throughput dynamic network flows, Math Program 27 (1983), 214-231.
23. [23] J.B. Orlin, Minimum convex cost dynamic network flows, Math Oper Res 9 (1984), 190-207.
24. [24] A.B. Philpott, Continuous-time flows in networks, MOR 15 (1990), 640-661.
25. [25] A.B. Philpott and M. Craddock, An adaptive discretization method for a class of continuous network programs, Networks 26 (1995), 1-11.
26. [26] W.B. Powell, P. Jaillet, and A. Odoni, "Stochastic and dynamic networks and routing," Handbooks in operations research and management science: Networks, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (editors), Elsevier, 1995.
27. [27] M.C. Pullan, An algorithm for a class of continuous linear programs, SIAM J Control Optim 31 (1993), 1558-1577.
28. [28] M.C. Pullan, A study of general dynamic network programs with arc time-delays, SIAM J Optim 7 (1997), 889-912.
29. [29] G.I. Stassinopoulos and P. Konstantopoulos, Optimal congestion control in single destination networks, IEEE Trans Commun 33 (1985), 792-800.
30. [30] W.L. Wilkinson, An algorithm for universal maximal dynamic flows in a network, Oper Res 19 (1971), 1602-1612.