| Article ID: | iaor1995733 |
| Country: | Switzerland |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 61 |
| End Page Number: | 72 |
| Publication Date: | Sep 1994 |
| Journal: | Annals of Operations Research |
| Authors: | Boyd E. Andrew |
A cutting plane technique with applicability to the solution of integer programs is presented. The computational value of this technique is demonstrated by applying it to a collection of seven difficult integer programs arising from real-world applications. Four of the seven problems are solved to optimality without the aid of branch and bound, and six of the seven problems have the gap between the value of the integer program and its linear programming relaxation closed by over 98%.