137 citations · 650 across the 48 of their papers we have counts for
Showing 2014 · math.OCShow all
2 papers · 2 filters
math.OC2014
Some lower bounds on sparse outer approximations of polytopes
Santanu S. Dey, Andres Iroume, Marco Molinaro
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how wel…
math.OC2014
How Good Are Sparse Cutting-Planes?
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Sparse cutting-planes are often the ones used in mixed-integer programing (MIP) solvers, since they help in solving the linear programs encountered during branch-&-bound more effic…