While many classes of cutting-planes are at the disposal of integer programming solvers, our
scientific understanding is far from complete with regards to cutting-plane selection, ie, the …

We define a new cutting plane closure for pure integer programs called the two-halfspace
closure. It is a natural generalization of the well-known Chvátal-Gomory closure. We prove …