137 citations · 650 across the 48 of their papers we have counts for
5 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…
The EPN-TAP protocol for the Planetary Science Virtual Observatory
S. Erard, B. Cecconi, P. Le Sidaner +9
A Data Access Protocol has been set up to search and retrieve Planetary Science data in general. This protocol will allow the user to select a subset of data from an archive in a s…
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 the Experts Algorithm Can Help Solve LPs Online
Anupam Gupta, Marco Molinaro
We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention an…
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…