On lifting integer variables in minimal inequalities
From MaRDI portal
Publication:3569810
DOI10.1007/978-3-642-13036-6_7zbMATH Open1285.90016OpenAlexW1764047695MaRDI QIDQ3569810FDOQ3569810
Authors: Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, Manoel Campêlo 
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_7
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cited In (15)
- The (not so) trivial lifting in two dimensions
- Unique lifting of integer variables in minimal inequalities
- Nonunique lifting of integer variables in minimal inequalities
- Valid inequalities for mips and group polyhedra from approximate liftings
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Minimal valid inequalities for integer constraints
- A geometric perspective on lifting
- Operations that preserve the covering property of the lifting region
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Lifting for conic mixed-integer programming
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Intersection cuts for single row corner relaxations
This page was built for publication: On lifting integer variables in minimal inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569810)
