References
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.
Balas, E., S. Ceria, and G. Cornuéjols. (1996). “Mixed 0–1 Programming by Lift-and-Project in a Branch-and-Cut Framework.” Management Science, 42, 1229–1246.
Balas, E., S. Ceria, G. Cornuéjols, and N. Natraj. (1996). “Gomory Cuts Revisited.” Operations Research Letters, 19, 1–9.
Gomory, R. (1960). An Algorithm for the Mixed Integer Problem. Technical Report RM-2597, The Rand Corporation.
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.
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.
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.
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.
Parker, R.G. and R.L. Rardin. (1988). Discrete Optimization. Academic Press, New York.
Williams, H.P. (1985). Model Building in Mathematical Programming. Wiley, New York.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cornuéjols, G. Revival of the Gomory cuts in the 1990’s. Ann Oper Res 149, 63–66 (2007). https://doi.org/10.1007/s10479-006-0100-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0100-1