| Article ID: | iaor20127768 |
| Volume: | 40 |
| Issue: | 6 |
| Start Page Number: | 578 |
| End Page Number: | 580 |
| Publication Date: | Nov 2012 |
| Journal: | Operations Research Letters |
| Authors: | Neto Jos |
| Keywords: | graphs, optimization |
A cutting plane algorithm is presented in order to solve linear integer programs in a finite number of iterations, under the assumption that the feasible region is bounded. The procedure also applies to the resolution of mixed integer programs in a finite number of iterations under the additional assumption that the optimal objective value is integral.