Valid inequalities for MIPs and group polyhedra from approximate liftings

Research output: Contribution to journalArticlepeer-review


In this paper, we present an approximate lifting scheme to derive valid inequalities for general mixed integer programs and for the group problem. This scheme uses superadditive functions as the building block of integer and continuous lifting procedures. It yields a simple derivation of new and known families of cuts that correspond to extreme inequalities for group problems. This new approximate lifting approach is constructive and potentially efficient in computation.

Original languageEnglish (US)
Pages (from-to)253-277
Number of pages25
JournalMathematical Programming
Issue number2
StatePublished - May 2009
Externally publishedYes


  • Approximate lifting
  • Group problem
  • Integer programming
  • Polyhedral theory

Cite this