30 citations · 54 across the 4 of their papers we have counts for
4 papers
Cutting Planes for Binarized Network Flow Problems
Pierre Bonami, Sanjeeb Dash, Anton Derkach +1
We consider integer programming problems with bounded general-integer variables belonging to the general class of network flow problems. For those, we computationally investigate t…
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…
On optimizing over lift-and-project closures
Pierre Bonami
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by com…