Operations that Preserve the Covering Property of the Lifting Region
From MaRDI portal
Publication:3454508
DOI10.1137/140990413zbMath1327.90125arXiv1410.1571OpenAlexW2963289897MaRDI QIDQ3454508
Publication date: 25 November 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.1571
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (8)
Theoretical challenges towards cutting-plane selection ⋮ The structure of the infinite models in integer programming ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Cut-Generating Functions for Integer Variables ⋮ A geometric approach to cut-generating functions
Cites Work
- Unnamed Item
- Unnamed Item
- Some properties of convex hulls of integer points contained in general convex sets
- Unique lifting of integer variables in minimal inequalities
- Lifting properties of maximal lattice-free polyhedra
- Strengthening cuts for mixed integer programs
- Lectures on algebraic topology.
- Two row mixed-integer cuts via lifting
- Unique Minimal Liftings for Simplicial Polytopes
- Constrained Infinite Group Relaxations of MIPs
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- A Geometric Perspective on Lifting
- Minimal Valid Inequalities for Integer Constraints
- Cut-Generating Functions
- Inequalities from Two Rows of a Simplex Tableau
This page was built for publication: Operations that Preserve the Covering Property of the Lifting Region
