Return to Colloquia & Seminar listing
Maximal Lattice-free Convex Sets and Cutting Planes
Algebra & Discrete Mathematics| Speaker: | Amitabh Basu, UC Davis |
| Location: | 1147 MSB |
| Start time: | Fri, Oct 29 2010, 2:10PM |
Description
We consider a lattice L in a finite dimensional vector space V.
A maximal lattice-free convex set is a convex set S in V, such that its
interior does not contain any lattice point from L and it is maximal with
respect to set inclusion. We characterize the structure of these sets in
this talk and survey the recent use of these objects in deriving cutting
planes for integer programs.