38 citations · 129 across the 25 of their papers we have counts for
3 papers · 1 filter
The Triangle Closure is a Polyhedron
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research ar…
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Köppe +1
We prove that any minimal valid function for the k-dimensional infinite group relaxation that is piecewise linear with at most k+1 slopes and does not factor through a linear map w…
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
Amitabh Basu, Robert Hildebrand, Matthias Köppe
We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced…