@article{Dash2010MIRCO,
title={MIR closures of polyhedral sets},
author={Sanjeeb Dash and Oktay G{\"u}nl{\"u}k and Andrea Lodi},
journal={Math. Program.},
year={2010},
volume={121},
pages={33-60}
}

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objective using additional variables to produce a linear MIP model that solves the separation problem… CONTINUE READING