Some lower bounds on sparse outer approximations of polytopes

Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [1] studied the idealized problem of how well a polytope is approximated by the use of sparse valid inequalities. As an extension to this work, we study the following “less idealized” questions in this pa- … Read more