A proof of Lovász's theorem on maximal lattice-free sets

DOI10.1007/s13366-012-0092-8zbMath1262.90107arXiv1110.1014OpenAlexW2147468949MaRDI QIDQ1943344

Gennadiy Averkov

Publication date: 19 March 2013

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.1014

zbMATH Keywords

cutting planeLovász's theoremlattice-free set

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Mixed integer programming (90C11) Axiomatic and generalized convexity (52A01)

Related Items

Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results, Tight bounds on discrete quantitative Helly numbers, Complexity of linear relaxations in integer programming, Multirow Intersection Cuts Based on the Infinity Norm, On finitely generated closures in the theory of cutting planes, Towards a characterization of maximal quadratic-free sets, Lifting properties of maximal lattice-free polyhedra, Helly’s theorem: New variations and applications, Approximation of Corner Polyhedra with Families of Intersection Cuts, A local maximizer for lattice width of 3-dimensional hollow bodies, A geometric approach to cut-generating functions

Cites Work

• Maximal Lattice-Free Convex Sets in Linear Subspaces
• An observation on the structure of production sets with indivisibilities
• A Theorem Concerning the Integer Lattice
• Convex and Discrete Geometry
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Unnamed Item
• Unnamed Item