Minimum-cost dynamic flows: The series-parallel case

Networks

Volumn 43, Issue 3, 2004, Pages 153-162

  Klinz, Bettina ^a   Woeginger, Gerhard J ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Dynamic network flow; Greedy algorithm; Minimum cost flow; Two terminal series parallel networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

COST DYNAMICS; GREEDY ALGORITHM; TWO TERMINAL NETWORK;

TELECOMMUNICATION NETWORKS;

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

References (19)

1. J.E. Aronson, A survey on dynamic network flows, Ann Oper Res 20 (1989), 1-66.
2. J.E. Aronson and B.D. Chen, A forward network simplex algorithm for solving multiperiod network flow problems, Naval Res Log Q 33 (1986), 445-467.
3. W.W. Bein, P. Brucker, and A. Tamir, Minimum cost flow algorithms for series-parallel networks, Discr Appl Math 10 (1985), 117-124.
4. R.E. Burkard, K. Dlaska, and B. Klinz, The quickest flow problem, ZOR Methods Models Oper Res 37 (1993), 31-58.
5. L. Fleischer and M. Skutella, The quickest multicommodity flow problem, Proc 9th Conf on Integer Programming and Combinatorial Optimization, Lecture notes in computer science 2337, Springer, Berlin, 2002, pp. 36-53.
6. L. Fleischer and M. Skutella, Minimum cost flows over time without intermediate storage, Proc 14th Ann ACM-SIAM Symp on Discrete Algorithms, 2003, pp. 66-75.
7. L.R. Ford and D.R. Fulkerson, Constructing maximal dynamic flows from static flows, Oper Res 6 (1958), 419-433.
8. M.R. Garey and D.S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
9. A. Hall, S. Hippler, and M. Skutella, Multicommodity flows over time: Efficient algorithms and complexity, Proc 30-th Int Colloq on Automata, Languages and Programming, Lecture notes in computer science, Springer, Berlin, 2003.
10. B. Hoppe and É. Tardos, Polynomial time algorithms for some evacuation problems, Proc 5-th Ann ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 433-441.
11. B. Hoppe and É. Tardos, The quickest transshipment problem, Math Oper Res 25 (2000), 36-62; a preliminary version appeared in Proc 6-th Ann ACM-SIAM Symp on Discrete Algorithms, 1995, pp. 512-521.
12. B. Hoppe and É. Tardos, The quickest transshipment problem, Math Oper Res 25 (2000), 36-62; a preliminary version appeared in Proc 6-th Ann ACM-SIAM Symp on Discrete Algorithms, 1995, pp. 512-521.
13. B. Klinz and G.J. Woeginger, "Minimum cost dynamic flows: The series-parallel case," Integer programming and combinatorial optimization, Proc 4th Int IPCO Conf. Springer lecture notes in computer science 920, E. Balas and J. Clausen (Editors), Springer-Verlag, Berlin, Heidelberg, 1995, pp. 329-343.
14. E. Minieka, Maximal, lexicographic, and dynamic network flows, Oper Res 21 (1973), 517-527.
15. J.B. Orlin, Minimum convex cost dynamic network flows, Math Oper Res 9 (1984), 190-207.
16. C.H. Papadimitriou, P. Serafini, and M. Yannakakis, Computing the throughput of a network with dedicated lines, Discr Appl Math 42 (1993), 271-278.
17. W.B. Powell, P. Jaillet, and A. Odoni, "Stochastic and dynamic networks and routing," Handbooks in operations research and management science: Network routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Elsevier, North-Holland, Amsterdam, 1995, Vol. 8, pp. 141-295.
18. J. Valdes, R.E. Tarjan, and E.L. Lawler, The recognition of series-parallel digraphs, SIAM J Comput 11 (1982), 298-313.
19. W.L. Wilkinson, An algorithm for universal maximal dynamic flows in a network, Oper Res 19 (1971), 1602-1612.