Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science

Volumn 42, Issue 9, 1996, Pages 1229-1246

  Balas, Egon ^a   Ceria, Sebastían ^a   Cornuéjols, Gérard ^a  

^a NONE

Author keywords

Branch and Bound; Branch and Cut; Cutting Planes; Integer Programming

Indexed keywords

EID: 0037870067     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.42.9.1229     Document Type: Article

References (19)

1. Balas, E., "Intersection Cuts - A New Type of Cutting Planes for Integer Programming," Oper. Res., 19 (1971), 19-39.
2. Balas, E., "Disjunctive Programming," Ann. Discrete Math., 5 (1979), 3-51.
3. _, S. Ceria, and G. Cornuéjols, "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs," Math. Programming, 58 (1993a), 295-324.
4. _, _, and _, "Solving Mixed 0-1 Programs by a Lift-and-Project Method," Proc. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993b, 232-242.
5. _ and R. Jeroslow, "Strengthening Cuts for Mixed Integer Programs," European J. Oper. Res., 4 (1980), 224-234.
6. Beasley, J. E., OR-library: "Distributing Test Problems by Electronic Mail," J. Oper. Res. Society, 41 (1990), 1069-1072.
7. Berman and Pelc, "Distributed Fault Diagnosis for Multiprocessor Systems," Proc. 20th Annual Symposium on Fault-Tolerant Computing, 340-346.
8. Bixby, R. E., E. A. Boyd, and R. R. Indovina, MIPLIB: "A Test Set of Mixed Integer Programming Problems," SIAM News, March (1992), 16.
9. Crowder, H., E. Johnson, and M. Padberg, "Solving Large-scale Zero-one Linear Programming Problems," Oper. Res., 31 (1983), 803-834.
10. Gomory, R., "An Algorithm for the Mixed Integer Problem," Technical Report RM-2597, The Rand Corporation, Santa Monica, CA, 1960.
11. Hoffman, K. L., and M. Padberg, "Techniques for Improving the LP-representation of Zero-one Linear Programming Problems," ORSA J. Computing, 3 (1991), 121-134.
12. _ and _, "Solving Airline Crew Scheduling Problems by Branch-and-cut," Management Sci., 39 (1993), 657-682.
13. M. Jünger, private communication, 1993.
14. Lovász, L. and A. Schrijver, "Cones of Matrices and Set-functions and 0-1 Optimization," SIAM J. Optimization, 1 (1991), 166-190.
15. P. Nobili and A. Sassano, private communication, 1993.
16. Padberg, M. and G. Rinaldi, "A Branch-and-Cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesman Problems," SIAM Review, 33 (1991), 60-100.
17. Sherali, H. and W. Adams, "A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-one Programming Problems," SIAM J. Disc. Math., 3 (1990), 411-430.
18. Ursic, S., "A Linear Characterization of NP-Complete Problems," Seventh International Conf. on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, 170 (1984), 80-100.
19. Van Roy, T. J. and L. A. Wolsey, "Solving Mixed Integer Programming Problems Using Automatic Reformulation," Oper. Res., 35 (1987), 45-57.