A faster combinatorial algorithm for the generalized circulation problem

Mathematics of Operations Research

Volumn 21, Issue 3, 1996, Pages 529-539

  Goldfarb, Donald ^a   Jin, Zhiying ^a  

^a Columbia University ^*  (United States)

Author keywords

Arc imbalance; Combinatorial optimization; Generalized circulation; Generalized maximum flow; Network flow; Pseudoflow augmentation

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

FASTER COMBINATORIAL ALGORITHM; FAT PATH COMBINATORIAL ALGORITHMS; GENERALIZED CIRCULATION PROBLEM;

ALGORITHMS;

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

References (16)

1. Ahuja, R., T. Magnanti, J. Orlin (1993). Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, New Jersey.
2. Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numer. Math. 1 269-271.
3. Fredman, M. L., R. E. Tarjan (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34 596-615.
4. Glover, F., D. Klingman, N. Phillips (1990). Netform modeling and applications. Interfaces 20 7-27.
5. _, J. Hultz, D. Klingman, J. Stutz (1978). Generalized networks: A fundamental computer based planning tool. Management Sci. 24 1209-1220.
6. _, D. Klingman (1973). On the equivalence of some generalized network problems to pure network problems. Math. Programming 4 269-278.
7. Goldberg, A. V., S. A. Plotkin, E. Tardos (1991). Combinatorial algorithms for the generalized circulation problem. Math. Oper. Res. 16 351-379.
8. Kamath, A., O. Palmon (1995). Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. Proc. 6th ACM-SIAM Symposium on Discrete Algorithms 502-511.
9. Kapoor, S., P. M. Vaidya (1986). Fast algorithms for convex quadratic programming and multicommodity flows. Proc. 18th Annual ACM Symposium on Theory of Computing 147-159.
10. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica 4 373-395.
11. Khachian, L. G. (1980). Polynomial algorithms in linear programming. Zh. Vychis. Mat. i Mat. Fiz. 20 53-72.
12. Onaga, K. (1966). Dynamic programming of optimum flows in lossy communication nets. IEEE Trans. Circuit Theory 13 308-327.
13. Orlin, J. B. (1993). A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41 338-350.
14. Radzik, T. (1993). Faster algorithms for the generalized network flow problem. Proc. 34th IEEE Annual Symposium on Foundations of Computer Science 438-448.
15. Truemper, K. (1977). On max flows with gains and pure min-cost flows. SIAM J. Appl. Math. 32 450-456.
16. Vaidya, P. M. (1989). Speeding up linear programming using fast matrix multiplication. Proc. 30th IEEE Annual Symposium on Foundations of Computer Science 332-337.