Non-standard approaches to integer programming Original Research Article

In this survey we address three of the principal algebraic approaches to integer programming. After introducing lattices and basis reduction, we first survey their use in integer programming, presenting among others Lenstraʹs algorithm that is polynomial in fixed dimension, and the solution of diophanine equations using basis reduction. The second topic concerns augmentation algorithms and test sets, including the role played by Hilbert and Gröbner bases in the development of a primal approach to solve a family of problems for all right-hand sides. Thirdly we survey the group approach of Gomory, showing the importance of subadditivity in integer programming and the generation of valid inequalities, as well the relation to the parametric problem cited above of solving for all right-hand sides.