Non-standard approaches to integer programming

Karen Aardal, Robert Weismantel, Laurence A Wolsey

Research output: Contribution to journalArticleScientificpeer-review

45 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)5-74
Number of pages70
JournalDiscrete Applied Mathematics
Issue number1-3
Publication statusPublished - 2002
Externally publishedYes


  • Integer programming
  • Lattice basis reduction
  • Lenstra's algorithm
  • Test sets
  • Augmentation algorithms
  • Gröbner basis
  • Asymptotic group problem
  • Subadditivity
  • Corner polyhedron


Dive into the research topics of 'Non-standard approaches to integer programming'. Together they form a unique fingerprint.

Cite this