On finitely generated closures in the theory of cutting planes
From MaRDI portal
Publication:1926485
DOI10.1016/j.disopt.2012.06.003zbMath1254.90126arXiv1110.3967OpenAlexW2962949660MaRDI QIDQ1926485
Publication date: 28 December 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.3967
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Mixed integer programming (90C11) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
On the polyhedrality of cross and quadrilateral closures, Integer packing sets form a well-quasi-ordering, Lattice closures of polyhedra, Lifting properties of maximal lattice-free polyhedra, Generalized flatness constants, spanning lattice polytopes, and the Gromov width, Two-halfspace closure, Split Cuts in the Plane, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, The triangle closure is a polyhedron, Relaxations of mixed integer sets from lattice-free polyhedra, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, The aggregation closure is polyhedral for packing and covering integer programs, On a generalization of the Chvátal-Gomory closure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Inequalities for the lattice width of lattice-free convex sets in the plane
- On convergence in mixed integer programming
- Chvátal closures for mixed integer programming problems
- A proof of Lovász's theorem on maximal lattice-free sets
- The triangle closure is a polyhedron
- On the number of convex lattice polytopes
- Edmonds polytopes and a hierarchy of combinatorial problems
- Projecting Lattice Polytopes Without Interior Lattice Points
- On the Chvátal-Gomory Closure of a Compact Convex Set
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Polyhedral Approaches to Mixed Integer Linear Programming
- On Cutting Planes
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
