Login / Signup
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
Amitabh Basu
Robert Hildebrand
Matthias Köppe
Published in:
CoRR (2011)
Keyphrases
</>
convex sets
cutting plane
finite number
integer programming problems
convex optimization
integer programming
variational inequalities
lower bound
worst case
computational complexity
convex hull
higher dimensional
mixed integer
column generation
feasible set