Revival of the Gomory cuts in the 1990's

Annals of Operations Research

Volumn 149, Issue 1, 2007, Pages 63-66

  Cornuéjols, Gérard ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846858656     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0100-1     Document Type: Review

References (10)

1. Balas, E., S. Ceria, and G. Cornuéjols. (1993). "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs, Math. Programming, 58, 295-324.
2. Balas, E., S. Ceria, and G. Cornuéjols. (1996). "Mixed 0-1 Programming by Lift-and-Project in a Branchand-Cut Framework." Management Science, 42, 1229-1246.
3. Balas, E., S. Ceria, G. Cornuéjols, and N. Natraj. (1996). "Gomory Cuts Revisited." Operations Research Letters, 19, 1-9.
4. Gomory, R. (1960). An Algorithm for the Mixed Integer Problem. Technical Report RM-2597, The Rand Corporation.
5. Gomory, R. (1963). "An Algorithm for Integer Solutions to Linear Programs." In R.L. Graves and P. Wolfe (Eds.) Recent Advances in Mathematical Programming, pp. 269-302. McGraw-Hill, New York.
6. Gomory, R. (1991). "Early Integer Programming, In J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver (Eds.). History of Mathematical Programming, A Collection of Personal Reminiscences, pp. 55-61. North-Holland, Amsterdam.
7. Nemhauser, G.L. and L.A. Wolsey. (1989). "Integer Programming." In G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (Eds.). Handbook in Operations Research and Management Science 1: Optimization, pp. 447-527. North-Holland, Amsterdam.
8. Padberg, M. and G. Rinaldi. (1991). "A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review, 33, 60-100.
9. Parker, R.G. and R.L. Rardin. (1988). Discrete Optimization. Academic Press, New York.
10. Williams, H.P. (1985). Model Building in Mathematical Programming. Wiley, New York.