8 citations · 17 across the 6 of their papers we have counts for
6 papers
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro +1
While semidefinite programming (SDP) problems are polynomially solvable in theory, it is often difficult to solve large SDP instances in practice. One technique to address this iss…
Characterization of the Split Closure via Geometric Lifting
Amitabh Basu, Marco Molinaro
We analyze split cuts from the perspective of cut generating functions via geometric lifting. We show that -cuts, a natural higher-dimensional generalization of the -cuts of…
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…
Geometry of Online Packing Linear Programs
Marco Molinaro, R. Ravi
We consider packing LP's with rows where all constraint coefficients are normalized to be in the unit interval. The n columns arrive in random order and the goal is to set the…