30 citations · 59 across the 6 of their papers we have counts for
5 papers · 1 filter
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization
Gérard Cornuéjols, Yatharth Dubey
In this paper, we consider a theoretical framework for comparing branch-and-bound with classical lift-and-project hierarchies. We simplify our analysis of streamlining the definiti…
Dyadic linear programming and extensions
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1
A rational number is dyadic if it has a finite binary representation , where is an integer and is a nonnegative integer. Dyadic rationals are important for numerical…
A Counterexample to a Conjecture of Gomory and Johnson
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
In Mathematical Programming 2003, Gomory and Johnson conjecture that the facets of the infinite group problem are always generated by piecewise linear functions. In this paper we g…
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…
Optimality certificates for convex minimization and Helly numbers
Amitabh Basu, Michele Conforti, Gérard Cornuéjols +2
We consider the problem of minimizing a convex function over a subset of R^n that is not necessarily convex (minimization of a convex function over the integer points in a polytope…