## Corner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory

- Amitabh Basu Tepper
- 2009

@inproceedings{Basu2009MaximalLC, title={Maximal Lattice-free Convex sets in 3 Dimensions}, author={Amitabh Basu and G{\'e}rard Cornu{\'e}jols and François Margot}, year={2009} }

- Published 2009

Given a lattice Λ, a lattice polyhedra is a convex polyhedra P , such that all vertices of P are lattice points and no other other point in P is a lattice point. By lattice-free convex set we mean a convex set with no lattice point from Λ in its strict interior. However lattice points are allowed on the boundary. We will usually work with the standard… CONTINUE READING

### Presentations referencing similar topics