30 citations · 69 across the 4 of their papers we have counts for
6 papers
MIP Formulations for the Steiner Forest Problem
Daniel Schmidt, Bernd Zey, François Margot
The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algor…
Partial hyperplane activation for generalized intersection cuts
Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas +1
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investig…
Intersection Cuts with Infinite Split Rank
Amitabh Basu, Gerard Cornuejols, Francois Margot
We consider mixed integer linear programs where free integer variables are expressed in terms of nonnegative continuous variables. When this model only has two integer variables, D…
Experiments with two-row cuts from degenerate tableaux
Amitabh Basu, Pierre Bonami, Gerard Cornuejols +1
There has been a recent interest in cutting planes generated from two or more rows of the optimal simplex tableau. One can construct examples of integer programs for which a single…
On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Amitabh Basu, Pierre Bonami, Gerard Cornuejols +1
Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilater…
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Andrea Qualizza, Pietro Belotti, Francois Margot
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequal…