New polynomial-time cycle-canceling algorithms for minimum-cost flows

Networks

Volumn 36, Issue 1, 2000, Pages 53-63

  Sokkalingam, P T ^a   Ahuja, Ravindra K ^b   Orlin, James B ^c  

^a HCL CISCO ODC Center   (India)

^b University of Florida   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Convex cost flow problem; Cycle canceling algorithm; Minimum cost flow problem; Network flows; Scaling algorithms; Strongly polynomial algorithms

Indexed keywords

EID: 0034239445     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y     Document Type: Article

References (12)

1. [1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliff, NJ, 1993.
2. [2] F. Barahona and E. Tardos, Note on Weintraub's minimum cost circulation algorithm, SIAM J Comput 18 (1989), 579-583.
3. [3] M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Proc 25th Annual IEEE Symp on Foundations of Computer Science, 1984, pp. 338-346. Full paper in J ACM 34 (1987), 596-615.
4. [3] M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Proc 25th Annual IEEE Symp on Foundations of Computer Science, 1984, pp. 338-346. Full paper in J ACM 34 (1987), 596-615.
5. [4] A.V. Goldberg and R.E. Tarjan, Finding minimum-cost circulation by canceling negative cycles, Proc 20th ACM Symp on the Theory of Computing, 1988, pp. 388-397. Full paper in J ACM 36 (1989), 873-886.
6. [4] A.V. Goldberg and R.E. Tarjan, Finding minimum-cost circulation by canceling negative cycles, Proc 20th ACM Symp on the Theory of Computing, 1988, pp. 388-397. Full paper in J ACM 36 (1989), 873-886.
7. [5] M. Klein, A primal method for minimum cost flows with application to the assignment and transportation problem, Mgmt Sci 14 (1967), 205-220.
8. [6] J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proc 20th ACM Symp on the Theory of Computing, 1988, pp. 377-387. Full paper in Oper Res 41 (1993), 338-350.
9. [6] J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proc 20th ACM Symp on the Theory of Computing, 1988, pp. 377-387. Full paper in Oper Res 41 (1993), 338-350.
10. [7] H. Rock, "Scaling techniques for minimal cost network flows," Discrete Structures and Algorithms, V. Page (Editor), Carl Hanser, Munich, 1980, pp. 181-191.
11. [8] M. Shigeno, S. Iwata, and S.T. McCormick, A faster cycle-cancelling minimum-cost flow algorithm and its dual, Technical Report, Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, Canada V6T 1Z2, 1996.
12. [9] C. Wallachar, A generalization of the minimum-mean cycle selection rule in cycle canceling algorithms, Technical Report, Instil. Fur Ang. Math., Braunschweig, Germany, 1991.