Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three

Details Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three

2010-10-06

arxiv.org/abs/1010.1077v2

Mathematics

Optimization and Control

Scientific paper

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision of a rational polyhedron $P$ in $\mathbb{R}^d$ is the smallest integer $s$ such that $sP$ is an integral polyhedron. In this paper we show that, up to affine mappings preserving $\mathbb{Z}^d$, the number of maximal lattice-free rational polyhedra of a given precision $s$ is finite. Furthermore, we present the complete list of all maximal lattice-free integral polyhedra in dimension three. Our results are motivated by recent research on cutting plane theory in mixed-integer linear optimization.

Affiliated with

Also associated with

No associations

Rating

Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427319