8 citations · 15 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
Mixed-integer Quadratic Programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In…
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…