Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

Operations Research Letters

Volumn 27, Issue 5, 2000, Pages 199-207

  McCormick, S Thomas ^a   Shioura, Akiyoshi ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b SOPHIA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

NEGATIVE CYCLE CANCELING ALGORITHMS; UNIMODULAR LINEAR SPACE;

OPERATIONS RESEARCH;

EID: 0034506383     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00059-6     Document Type: Article

References (26)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows - Theory, Algorithms, and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. Barahona F., Tardos É. Note on Weintraub's minimum-cost circulation algorithm. SIAM J. Comp. 18:1989;579-583.
3. Ervolina T.R., McCormick S.T. Canceling most helpful total cuts for minimum cost network flow. Networks. 23:1993;41-52.
4. Ervolina T.R., McCormick S.T. Two strongly polynomial cut canceling algorithms for minimum cost network flow. Discrete Appl. Math. 46:1993;133-165.
5. Goldberg A.V., Rao S. Beyond the flow decomposition barrier. J. ACM. 45:1998;753-782.
6. Goldberg A.V., Tarjan R.E. A new approach to the maximum flow problem. J. ACM. 35:1988;921-940.
7. Goldberg A.V., Tarjan R.E. Finding minimum-cost circulations by cancelling negative cycles. J. ACM. 36:1989;873-886.
8. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer, Berlin.
9. M. Hadjiat, Un algorithme fortement polynomial pour la tension de coût minimum basé sur les cocycles de coûts moyens minimums, Technical Report, Groupe Intelligence Artificielle, Faculté des Sciences de Luminy, Marseille France, 1994 (in French).
10. Hassin R. The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm. Math. Programming. 25:1983;228-239.
11. Karzanov A.V., McCormick S.T. Polynomial methods for separable convex optimization in unimodular spaces with applications. SIAM J. Comp. 26:1997;1245-1275.
12. Klein M. A primal method for minimal cost flows. Management Sci. 14:1967;205-220.
13. S.T. McCormick, A. Schulz, A. Shioura, R. Weismantel, An oracle-polynomial primal augmentation algorithm for mixed integer programs, manuscript, May 2000.
14. S.T. McCormick, A. Shioura, A minimum ratio cycle cancelling algorithm for linear programming problems with application to network optimization problems, manuscript, November 1996.
15. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. 30:1983;852-865.
16. Queyranne M. Theoretical efficiency of the algorithm 'Capacity' for the maximum flow problem. Math. Oper. Res. 5:1980;258-266.
17. Radzik T. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. Pardalos P. Complexity in Numerical Optimization. 1993;351-386 World Scientific, Singapore.
18. Rockafellar R.T. Network Flows and Monotropic Optimizatiion. 1984;Wiley, New York.
19. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.
20. A.S. Schulz, R. Weismantel, A polynomial-time augmentation algorithm for integer programming, manuscript, Fachbereich Mathmatik, Technische Universität Berlin, 1998.
21. Shigeno M., Iwata S., McCormick S.T. Relaxed most negative cycle and most positive cut cancelling algorithms for minimum cost flow. Math. Oper. Res. 25:2000;76-104.
22. Tardos É. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34:1986;250-256.
23. C. Wallacher, A generalization of the minimum-mean cycle selection rule in cycle cancelling algorithms, unpublished manuscript, Institut für Angewandte Mathematik, Technische Universität Braunschweig, 1989.
24. K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999.
25. Weintraub A. A primal algorithm to solve network flow problems with convex costs. Management Sci. 21:1974;87-97.
26. Zadeh N. More pathological examples for network flow problems. Math. Programming. 5:1973;217-224.