On the complexity of a cutting plane algorithm for solving combinatorial linear programs

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 3, 1996, Pages 365-376

  Boyd, E Andrew ^a  

^a Texas A and M University   (United States)

Author keywords

Cutting planes; Integer programming

Indexed keywords

COMBINATORIAL OPTIMIZATION; CUTTING PLANE METHOD; OBJECTIVE FUNCTION; POLYNOMIAL TIME;

INTEGER PROGRAMMING; ITERATIVE METHODS;

ALGORITHMS;

EID: 0030365940     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548019325900X     Document Type: Article

References (24)

1. D. APPLEGATE AND W. COOK (1991), A computational study of the job-shop scheduling problem, ORSA J. Comput., 3, pp. 149-156.
2. E. BALAS, S. CERIA, AND G. CORNUÉJOLS (1993), A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Programming, 58, pp. 295-324.
3. M. S. BAZARAA, H. D. SHERALI, AND C. M. SHETTY (1993), Nonlinear Programming: Theory and Algorithms, Wiley and Sons, New York.
4. R. G. BLAND, D. GOLDFARB, AND M. J. TODD (1981), The ellipsoid method: A survey, Oper. Res., 29, pp. 1039-1091.
5. E. A. BOYD (1995), On the convergence of Fenchel cutting planes in mixed-integer programming, SIAM J. Optim., 5, pp. 421-435.
6. V. CHVÁTAL (1973), Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math., 4, pp. 305-337.
7. H. CROWDER, E. L. JOHNSON, AND M. W. PADBERG (1983), Solving large-scale zero-one linear programming problems, Oper. Res., 31, pp. 803-834.
8. A. FRANK AND E. TARDOS (1987), An application of simultaneous diophantine approximation in combinatorial optimization, Combinatorica, 7, pp. 49-65.
9. D. GOLDFARB AND M. J. TODD (1989), Linear Programming, in Optimization, G. L. Nemhauser et al., eds., Elsevier Science Publishers, New York.
10. R. E. GOMORY (1958), Outline of an algorithm for integer solutions to linear programs, Bull. Amer. Math. Soc., 64, pp. 275-278.
11. _ (1963), An algorithm for integer solutions to linear programs, in Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe, eds., McGraw Hill, New York, pp. 269-302.
12. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER (1988), Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York.
13. K. L. HOFFMAN AND M. W. PADBERG (1991), Improving the LP-representation of zero-one linear programs for branch-and-cut, ORSA J. Comput., 3, pp. 121-134.
14. M. KOJIMA, S. MIZUNO, AND A. YOSHISE (1989), A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44, pp. 1-26.
15. _ (1991), An O(√nL) iteration potential reduction algorithm for linear complementarity problems, Math. Programming, 50, pp. 331-342.
16. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, EDS. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley and Sons, New York.
17. L. LOVÁSZ AND A. SCHRIJVER (1991), Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1, pp. 166-190.
18. G. L. NEMHAUSER AND L. A. WOLSEY (1988), Integer and Combinatorial Optimization, Wiley and Sons, New York.
19. M. PADBERG AND M. GRÖTSCHEL (1985), Polyhedral computations, in The Traveling Salesman Problem, E. L. Lawler et al., eds., Wiley and Sons, New York.
20. M. PADBERG AND G. RINALDI (1991), A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev., 33, pp. 60-100.
21. W. P. SAVELSBERGH, G. C. SIGISMONDI, AND G. L. NEMHAUSER (1991), MINTO, A Mixed Integer Optimizer, Tech. report COC-91-04, Computational Optimization Center, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
22. J. F. SHAPIRO (1979), Mathematical Programming: Structures and Algorithms, Wiley and Sons, New York.
23. H. SHERALI AND W. ADAMS (1990), A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3, pp. 411-430.
24. E. TARDOS (1986), A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res., 34, pp. 250-256.