The complexity of generic primal algorithms for solving general integer programs

Mathematics of Operations Research

Volumn 27, Issue 4, 2002, Pages 681-692

  Schulz, Andreas S ^a   Weismantel, Robert ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Augmentation problem; Combinatorial optimization; Computational complexity; Integer programming; Primal algorithms

Indexed keywords

INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

AUGMENTATION PROBLEM; GENERIC PRIMAL ALGORITHMS;

ALGORITHMS;

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

References (26)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Conti, P., C. Traverso. 1991. Buchberger algorithm and integer programming. H. F. Mattson, T. Mora, T. R. N. Rao, eds. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, No. 539. Lecture Notes in Computer Science, Proc. of the 9th Internet. AAECC Sympos. Springer, Berlin, Germany, 130-139.
3. Cornuéjols, G., R. Urbaniak, R. Weismantel, L. A. Wolsey. 1997. Decomposition of integer programs and of generating sets. R. Burkard, G. Woeginger, eds. Algorithms-ESA'97, No. 1284. Lecture Notes in Computer Science, Proc. of the 5th Annual Eur. Sympos. on Algorithms. Springer, Berlin, Germany, 92-103.
4. Edmonds, J., R. M. Karp. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19 248-264.
5. Goldberg, A. V., R. E. Tarjan. 1989. Finding minimum-cost circulations by cancelling negative cycles. J. Assoc. Comput. Mach. 36 873-886.
6. Grötschel, M., L. Lovász. 1995. Combinatorial optimization. R. Graham, M. Grötschel, L. Lovász, eds. Vol. II, Chap. 28. Handbook of Combinatorics, North-Holland, Amsterdam, The Netherlands, 1541-1597.
7. ____, ____, A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization, vol. 2. Algorithms and Combinatorics. Springer, Berlin, Germany.
8. Hosten, S., B. Sturmfels. 1995. GRIN: An implementation of Gröbner bases for integer programming. E. Balas, J. Clausen, eds. Integer Programming and Combinatorial Optimization, No. 920. Lecture Notes in Computer Science, Proc. of the 4th Internat. IPCO Conference. Springer, Berlin, Germany, 267-276.
9. Karp, R. M. 1978. A characterization of the minimum cycle mean in a digraph. Discrete Math. 23 309-311.
10. McCormick, S. T., T. R. Ervolina, B. Zhou. 1994. Mean canceling algorithms for general linear programs, and why they (probably) don't work for submodular flow. Working Paper 94-MSC-011, University of British Columbia, Faculty of Commerce, Vancouver, Canada.
11. ____, A. Shioura. 1996. A minimum ratio cycle canceling algorithm for linear programming problems with application to network optimization problems. Manuscript.
12. ____, ____, 2000. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Oper. Res. Lett. 27 199-207.
13. Naddef, D. 1989. The Hirsch conjecture is true for (0, 1)-polytopes. Math. Programming 45 109-110.
14. Orlin, J. B., R. K. Ahuja. 1992. New scaling algorithms for the assignment and minimum cycle mean problems. Math. Programming 54 41-56.
15. Schulz, A. S., R. Weismantel. 1999. An oracle-polynomial time augmentation algorithm for integer programming. Proc. of the 10th Annual ACM-SIAM Sympos. on Discrete Algorithms. Association for Computing Machinery (ACM) and Society for Industrial and Applied Mathematics (SIAM), Baltimore, MD, 967-968.
16. ____, ____, G. M. Ziegler. 1995. 0/1-integer programming: Optimization and augmentation are equivalent. P. Spirakis, ed. Algorithms-ESA '95, No. 979. Lecture Notes in Computer Science, Proc. of the 3rd Annual Eur. Sympos. on Algorithms. Springer, Berlin, Germany, 473-483.
17. Shigeno, M., S. Iwata, S. T. McCormick. 2000. Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow. Math. Oper. Res. 25 76-104.
18. Sokkalingam, P. T., R. K. Ahuja, J. B. Orlin. 2000. New polynomial-time cycle-canceling algorithms for minimum-cost flows. Networks 36 53-63.
19. Sturmfels, B., R. R. Thomas. 1997. Variation of cost functions in integer programming. Math. Programming 77 357-388.
20. ____, R. Weismantel, G. M. Ziegler. 1995. Gröbner bases of lattices, corner polyhedra, and integer programming. Contributions Algebra Geometry 36 281-298.
21. Thomas, R. R. 1995. A geometric Buchberger algorithm for integer programming. Math. Oper. Res. 20 864-884.
22. ____, R. Weismantel. 1996. Test sets and inequalities for integer programs. W. H. Cunningham, S. T. McCormick, M. Queyranne, eds. Integer Programming and Combinatorial Optimization, No. 1084. Lecture Notes in Computer Science, Proc. of the 5th Internat. IPCO Conf. Springer, Berlin, Germany, 16-30.
23. Urbaniak, R., R. Weismantel, G. M. Ziegler. 1997. A variant of the Buchberger algorithm for integer programming. SIAM J. Discrete Math. 10 96-108.
24. Wallacher, C. 1992 Kombinatorische Algorithmen für Flußprobleme und submodulare Flußprobleme. Ph.D. Thesis, Technische Universität zu Braunschweig, Braunschweig, Germany.
25. ____, U. Zimmermann. 1992. A combinatorial interior point method for network flow problems. Math. Programming 56 321-335.
26. Wayne, K. D. 1999. A polynomial combinatorial algorithm for generalized minimum cost flow. Proc. of the 31st Annual ACM Sympos. on Theory of Comput. 11-18.