Lifted cover inequalities for 0-1 integer programs: Computation

INFORMS Journal on Computing

Volumn 10, Issue 4, 1998, Pages 427-437

  Gu, Zonghao ^a   Nemhauser, George L ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

0 1 integer programming; Branch and cut; Cover inequality; Integer Programming; Lifting

Indexed keywords

EID: 0000660003     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.4.427     Document Type: Article

References (28)

1. E. BALAS, 1975. Facets of the Knapsack Polytope, Mathematical Programming 8, 146-164.
2. E. BALAS and E. ZEMEL, 1978. Facets of the Knapsack Polytope from Minimal Covers, SIAM Journal on Applied Mathematics 34, 119-148.
3. R.E. BIXBY, E.A. BOYD, S.S. DADMEHR, and R.R. INDOVINA, 1992. The MIPLIB Mixed Integer Programming Library, Technical Report R92-36, Rice University.
4. CPLEX OPTIMIZATION, INC., 1994. Using the CPLEX Callable Library and CPLEX Mixed Integer Library, Version 3.0.
5. H. CROWDER, E.L. JOHNSON, and M.W. PADBERG, 1983. Solving Large Scale Zero-One Linear Programming Problems, Operations Research 31, 803-834.
6. R.E. GOMORY, 1969. Some Polyhedra Related to Combinatorial Problems, Linear Algebra and Its Applications 2, 451-558.
7. M. GRÖTSCHEL, M. JÜNGER, and G. REINELT, 1984. A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research 32, 1195-1220.
8. Z. GU, 1995. Lifted Cover Inequalities for 0-1 and Mixed 0-1 Integer Programs. Ph.D. thesis, Georgia Institute of Technology.
9. Z. GU, G.L. NEMHAUSER, and M.W.P. SAVELSBERGH, 1994. Lifted Cover Inequalities for 0-1 Integer Programs: Complexity, INFORMS Journal on Computing, to appear.
10. Z. GU, G.L. NEMHAUSER, and M.W.P. SAVELSBERGH, 1998. Lifted Cover Inequalities for 0-1 Integer Programs: Algorithms. In preparation.
11. P.L. HAMMER, E.L. JOHNSON, and U.N. PELED, 1975. Facets of Regular 0-1 Polytopes, Mathematical Programming 8, 179-206.
12. D. HARTVIGSEN and E. ZEMEL, 1992. The Complexity of Lifted Inequalities for the Knapsack Problem, Discrete Applied Mathematics 39, 113-123.
13. K.L. HOFFMAN and M.W. PADBERG, 1985. LP-Based Combinatorial Problem Solving, Annals of Operations Research 4, 145-194.
14. K.L. HOFFMAN and M.W. PADBERG, 1991. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut, ORSA Journal on Computing 3, 121-134.
15. IBM CORPORATION, 1990. Optimization Subroutine Library, Guide and Reference.
16. E.L. JOHNSON and M.W. PADBERG, 1981. A Note on the Knapsack Problem with Special Ordered Sets, Operations Research Letters 1, 18-22.
17. S. MARTELLO and P. TOTH, 1990. Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York.
18. G.L. NEMHAUSER, M.W.P. SAVELSBERGH, and G.C. SIGISMONDI, 1994. MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15, 47-58.
19. G.L. NEMHAUSER and P.H. VANCE, 1994. Lifted Cover Facets of the 0-1 Knapsack Polytope with GUB Constraints, Operations Research Letters 16, 255-263.
20. G.L. NEMHAUSER and L.A. WOLSEY, 1988. Integer and Combinatorial Optimization, Wiley, New York.
21. M.W. PADBERG, 1973. On the Facial Structure of Set Packing Polyhedra, Mathematical Programming 5, 199-215.
22. M. PADBERG and G. RINALDI, 1987. Optimization of a 532 City Symmetric Traveling Salesman Problem by Branch and Cut. Operations Research Letters 6, 1-7.
23. T.J. VAN ROY and L.A. WOLSEY, 1987. Solving Mixed 0-1 Programs by Automatic Reformulation, Operations Research 35, 45-57.
24. L.A. WOLSEY, 1975. Faces for a Linear Inequality in 0-1 Variables, Mathematical Programming 8, 165-178.
25. L.A. WOLSEY, 1976. Facets and Strong Valid Inequalities for Integer Programs, Operations Research 24, 367-372.
26. L.A. WOLSEY, 1990. Valid Inequalities For 0-1 Knapsacks and MIPS with Generalized Upper Bound Constraints, Discrete Applied Mathematics 29, 251-261.
27. E. ZEMEL, 1978. Lifting the Facets of Zero-One Polytopes, Mathematical Programming 15, 268-277.
28. E. ZEMEL, 1989. Easily Computable Facets of the Knapsack Polytope, Mathematics of Operations Research 14, 760-765.