| Article ID: | iaor2003781 |
| Country: | Germany |
| Volume: | 53 |
| Issue: | 3 |
| Start Page Number: | 353 |
| End Page Number: | 361 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Weismantel R., Haus U.-U., Kppe M. |
This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear diophantine inequalities. We demonstrate the algorithm's potential by testing it on some instances of the MIPLIB with up to 6000 variables.