Lifting properties of maximal lattice-free polyhedra
From MaRDI portal
Publication:896280
DOI10.1007/s10107-015-0865-6zbMath1328.90084arXiv1404.7421OpenAlexW1977146361MaRDI QIDQ896280
Amitabh Basu, Gennadiy Averkov
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7421
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Mixed integer programming (90C11) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items
Tight bounds on discrete quantitative Helly numbers, Operations that Preserve the Covering Property of the Lifting Region, Theoretical challenges towards cutting-plane selection, Nonunique Lifting of Integer Variables in Minimal Inequalities, Can Cut-Generating Functions Be Good and Efficient?, The (not so) trivial lifting in two dimensions, Lifting convex inequalities for bipartite bilinear programs, Hollow polytopes of large width, The strength of multi-row aggregation cuts for sign-pattern integer programs, Lifting convex inequalities for bipartite bilinear programs, The covering radius and a discrete surface area for non-hollow simplices, Maximal $S$-Free Convex Sets and the Helly Number, Computing the covering radius of a polytope with an application to lonely runners, A geometric approach to cut-generating functions
Cites Work
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Unique lifting of integer variables in minimal inequalities
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- Polytopes with centrally symmetric facets
- On finitely generated closures in the theory of cutting planes
- A proof of Lovász's theorem on maximal lattice-free sets
- Some polyhedra related to combinatorial problems
- Polytopes with centrally symmetric faces
- Convexity in cristallographical lattices
- Two row mixed-integer cuts via lifting
- A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation
- Unique Minimal Liftings for Simplicial Polytopes
- Integer Programming with a Fixed Number of Variables
- A Geometric Perspective on Lifting
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- An observation on the structure of production sets with indivisibilities
- Lectures on Polytopes
- Convex and Discrete Geometry
- Convex Analysis
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
