Nonunique lifting of integer variables in minimal inequalities
From MaRDI portal
Publication:5376544
DOI10.1137/17M1117070zbMATH Open1411.90220arXiv1605.06686OpenAlexW2810998404WikidataQ127945041 ScholiaQ127945041MaRDI QIDQ5376544FDOQ5376544
Authors: Amitabh Basu, Joseph Paat, Santanu S. Dey 
Publication date: 13 May 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Abstract: We explore the lifting question in the context of cut-generating functions. Most of the prior literature on this question focuses on cut-generating functions that have the unique lifting property. We develop a general theory for understanding the lifting question for cut-generating functions that do not necessarily have the unique lifting property.
Full work available at URL: https://arxiv.org/abs/1605.06686
Recommendations
Cites Work
- Two row mixed-integer cuts via lifting
- Unique minimal liftings for simplicial polytopes
- Minimal inequalities for an infinite relaxation of integer programs
- A geometric perspective on lifting
- The group-theoretic approach in mixed integer programming
- Unique lifting of integer variables in minimal inequalities
- Cut-generating functions and \(S\)-free sets
- Title not available (Why is that?)
- On the extreme inequalities of infinite group problems
- Mixing mixed-integer inequalities
- An integer programming approach for linear programs with probabilistic constraints
- Cut-generating functions
- Lectures on algebraic topology.
- On mixing inequalities: rank, closure, and cutting-plane proofs
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- A note on the split rank of intersection cuts
- Convex sets and minimal sublinear functions
- Integer Programming
- The Mixing Set with Flows
- The Continuous Mixing Polyhedron
- Lifting properties of maximal lattice-free polyhedra
- Mixed-Integer Vertex Covers on Bipartite Graphs
- A geometric approach to cut-generating functions
- Operations that preserve the covering property of the lifting region
- On maximal \(S\)-free convex sets
Cited In (15)
- Unique lifting of integer variables in minimal inequalities
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Maximal quadratic-free sets
- Maximal quadratic-free sets
- On lifting integer variables in minimal inequalities
- A geometric perspective on lifting
- On the unique-lifting property
- Operations that preserve the covering property of the lifting region
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Lifting properties of maximal lattice-free polyhedra
- Monoidal strengthening and unique lifting in MIQCPs
- Can cut-generating functions be good and efficient?
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Towards a characterization of maximal quadratic-free sets
Uses Software
This page was built for publication: Nonunique lifting of integer variables in minimal inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376544)
