1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs
Santanu S. Dey, Andres Iroume, Guanyi Wang
In this paper, we study the strength of aggregation cuts for sign-pattern integer programs (IPs). Sign-pattern IPs are a generalization of packing IPs and are of the form $\{x\in \…
Improving the Randomization Step in Feasibility Pump
Santanu S. Dey, Andres Iroume, Marco Molinaro +1
Feasibility pump (FP) is a successful primal heuristic for mixed-integer linear programs (MILP). The algorithm consists of three main components: rounding fractional solution to a…
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…