Faster algorithms for the generalized network flow problem

Mathematics of Operations Research

Volumn 23, Issue 1, 1998, Pages 69-100

  Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Approximate optimality conditions; Generalized circulation; Generalized flow; Network optimization; Network problem

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING;

GENERALIZED NETWORK FLOW PROBLEM;

ALGORITHMS;

EID: 0032001762     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.1.69     Document Type: Article

References (17)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin (1993). Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, New Jersey.
2. Cohen, E., N. Megiddo (1994). New algorithms for generalized network flows. Math. Programming 64 325-336.
3. Ford, L. R. Jr., D R. Fulkerson (1962). Flows in Networks, Princeton University Press, Princeton, New Jersey.
4. Fredman, M. L., R. E. Tarjan (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34 596-615.
5. Glover, F., J. Hultz, D. Klingman, J. Stutz (1978). Generalized networks: A fundamental computer-based planning tool. Management Sci. 24 12.
6. Goldberg, A. V., R. E. Tarjan (1989). Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach. 36 388-397.
7. _, S. A Plotkin, E. Tardos (1991). Combinatorial algorithms for the generalized circulation problem. Math Oper. Res. 16 351-381.
8. Goldfarb, D., Z. Jin (1996). A faster combinatorial algorithm for the generalized circulation problem. Math. Oper. Res. 21 529-539.
9. _, _, J. Orlin (1996). Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem, Technical report, IEOR Department, Columbia University, New York.
10. Gondran, M., M. Minoux (1984). Graphs and Algorithms, Wiley, New York.
11. Kamath, A., O. Palmon (1995). Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 502-511.
12. Kapoor, S., P. M. Vaidya (1986). Fast algorithms for convex quadratic programming and multi-commodity flows. Proc. 18th Annual ACM Symposium on Theory of Computing, 147-159.
13. Murray, S. M. (1992). An interior point approach to the generalized flow problem with costs and related problems, Ph.D. Thesis, Stanford University.
14. Onaga, K. (1967). Optimal flows in general communication networks. J. Franklin Inst. 283 308-327.
15. Radzik, T. (1993) Approximate generalized circulation, Technical Report 93-2, Cornell Computational Optimization Project, Cornell University.
16. Vaidya, P. M. (1989). Speeding up linear programming using fast matrix multiplication. In Proc. 30th IEEE Annual Symposium on Foundations of Computer Science, 332-337.
17. Zadeh, N. (1973). A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Programming. 5 255-266.