Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem

Mathematics of Operations Research

Volumn 22, Issue 4, 1997, Pages 793-802

  Goldfarb, Donald ^a   Jin, Zhiying ^b   Orlin, James B ^c  

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

^b VERIZON   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Arc excess; Excess scaling; Generalized circulation; Generalized maximum flow; Highest gain augmenting path; Network flows

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

ARC EXCESS; EXCESS SCALING; GENERALIZED CIRCULATION PROBLEM; POLYNOMIAL TIME HIGHEST GAIN AUGMENTING PATH ALGORITHMS;

COMBINATORIAL MATHEMATICS;

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

References (20)

1. Ahuja, R., T. Magnanti, J. Orlin (1993). Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ.
2. Cohen, E., N. Megiddo (1994). New algorithms for generalized network flows. Math. Programming 64 325-336.
3. Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numeriche Mathematics 1 269-271.
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., D. Klingtnan, N. Phillips (1990). Netform modeling and applications. Interfaces 20 7-27.
6. _, J. Hultz, D. Klingman, J. Stutz (1978). Generalized networks: A fundamental computer based planning tool. Management Sci. 24 1209-1220.
7. _, D. Klingman (1973). On the equivalence of some generalized network problems to pure network problems. Math. Programming 4 269-278.
8. Goldberg, A. V., S. A. Plotkin, E. Tardos (1991). Combinatorial algorithms for the generalized circulation problem. Math. Oper. Res. 16 351-379.
9. _, R. E. Tarjan (1988). A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35 921-940.
10. Goldfarb, D., Z. Jin (1996). A faster combinatorial algorithm for the generalized circulation problem. Math. Oper. Res. 21 529-539.
11. _,_(1995). A polynomial dual simplex algorithm for the generalized circulation problem. Technical Report, Department of Industrial Engineering and Oper. Res., Columbia University.
12. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica 4 373-395.
13. 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.
14. Khachian, L. G. (1980). Polynomial algorithms in linear programming. Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki 20 53-72.
15. Lawler, E. L. (1976). Combinatorial Optimization: Networks and Matroids, Holt, Reinhart, and Winston, New York, NY.
16. Onaga, K. (1966). Dynamic programming of optimum flows in lossy communication nets. IEEE Trans. Circuit Theory 13 308-327.
17. Orlin, J. B. (1993). A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41 338-350.
18. Radzik, T. (1993). Faster algorithms for the generalized network flow problem. Proc. 34th IEEE Annual Symposium on Foundations of Computer Science 438-448.
19. Truemper, K. (1977). On max flows with gains and pure min-cost flows. SIAM J. Appl. Math. 32 450-456.
20. Vaidya, P. M. (1989). Speeding up linear programming using fast matrix multiplication. Proc. 30th IEEE Annual Symposium on Foundations of Computer Science 332-337.