77 citations · 160 across the 8 of their papers we have counts for
4 papers · 1 filter
Balas formulation for the union of polytopes is optimal
Michele Conforti, Marco Di Summa, Yuri Faenza
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of i…
A geometric approach to cut-generating functions
Amitabh Basu, Michele Conforti, Marco Di Summa
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau fo…
Maximal lattice-free convex sets in linear subspaces
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also…
Minimal inequalities for an infinite relaxation of integer programs
Amitabh Basu, Michele Conforti, Gerard Cornuejols +1
We show that maximal -free convex sets are polyhedra when is the set of integral points in some rational polyhedron of . This result extends a theorem of Lovás…