The integral basis method for integer programming
- 95 Downloads
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.
Unable to display preview. Download preview PDF.