Gomory Cuts and a Lot of Early Integer Programming
Mathematics Accomplishment | 1966
IBM researcher: Ralph Gomory
Where the work was done: IBM T.J. Watson Research Center
What we accomplished: Paraphrasing Wikipedia: Gomory Cuts are a method of iteratively refining a set of constraints expressed as linear inequalities to find optimal integer solutions to mixed integer-linear programming problems (Gomory, pictured).
- Wikipedia Article on Gomory Cuts
- Ralph Gomory Website
- Outline of an Algorithm for Integer Solutions to Linear Programs, Ralph E. Gomory, Bulletin of the American Mathematical Society, 64, pp. 275-278, 1958.
- Origin and early evolution of corner polyhedra (pdf) in European Journal of Operational Research.
Image credit: Heinz Awards