Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
From MaRDI portal
Publication:161306
DOI10.48550/arXiv.1010.1077zbMath1246.90107arXiv1010.1077OpenAlexW2021567595MaRDI QIDQ161306
Robert Weismantel, Gennadiy Averkov, Christian Wagner, Robert Weismantel, Christian Wagner, Gennadiy Averkov
Publication date: 6 October 2010
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.1077
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Mixed integer programming (90C11)
Related Items
Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Complexity of linear relaxations in integer programming, On the polyhedrality of cross and quadrilateral closures, On finitely generated closures in the theory of cutting planes, Classification of empty lattice 4-simplices of width larger than 2, Lattice zonotopes of degree 2, Lifting properties of maximal lattice-free polyhedra, Generating valid linear inequalities for nonlinear programs via sums of squares, On base loci of higher fundamental forms of toric varieties, Inequalities for the lattice width of lattice-free convex sets in the plane, Classification of empty lattice 4-simplices of width larger than two, Relaxations of mixed integer sets from lattice-free polyhedra, Approximation of Corner Polyhedra with Families of Intersection Cuts, The triangle closure is a polyhedron, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, On convergence in mixed integer programming, Local optimality of Zaks-Perles-Wills simplices, The complete classification of empty lattice 4-simplices, Classification of triples of lattice polytopes with a given mixed volume, Hollow polytopes of large width, Families of lattice polytopes of mixed degree one, The finiteness threshold width of lattice polytopes, Lattice 3-polytopes with few lattice points, Enumeration of lattice polytopes by their volume, Polytopes.Lattice.ExceptionalMaximalHollow, Cracked polytopes and Fano toric complete intersections, Difference between families of weakly and strongly maximal integral lattice-free polytopes, On the fine interior of three-dimensional canonical Fano polytopes, A geometric approach to cut-generating functions, Constructing lattice-free gradient polyhedra in dimension two
