Solving Integer and Disjunctive Programs by Lift and Project

@inproceedings{Ceria1998SolvingIA,
  title={Solving Integer and Disjunctive Programs by Lift and Project},
  author={Sebasti{\'a}n Ceria and G{\'a}bor Pataki},
  booktitle={IPCO},
  year={1998}
}
We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive constraints , and also present a new, substantially improved disjunctive cut generator. Employed together with an eecient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experience with the most diicult problems in the MIPLIB library.