Unique Minimal Liftings for Simplicial Polytopes
From MaRDI portal
Publication:2884321
DOI10.1287/moor.1110.0536zbMath1242.90116arXiv1103.4112OpenAlexW3099297138MaRDI QIDQ2884321
Cornuéjols, Gérard, Amitabh Basu, Matthias Köppe
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.4112
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items
Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Operations that Preserve the Covering Property of the Lifting Region, Theoretical challenges towards cutting-plane selection, Unique lifting of integer variables in minimal inequalities, Lifting properties of maximal lattice-free polyhedra, Nonunique Lifting of Integer Variables in Minimal Inequalities, Can Cut-Generating Functions Be Good and Efficient?, Relaxations of mixed integer sets from lattice-free polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, A geometric approach to cut-generating functions, Constructing lattice-free gradient polyhedra in dimension two, Light on the infinite group relaxation. I: Foundations and taxonomy
