On Lifting Integer Variables in Minimal Inequalities
From MaRDI portal
Publication:3569810
DOI10.1007/978-3-642-13036-6_7zbMath1285.90016OpenAlexW1764047695MaRDI QIDQ3569810
Michele Conforti, Amitabh Basu, Cornuéjols, Gérard, Giacomo Zambelli, Manoel B. 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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Intersection cuts for single row corner relaxations, Unique lifting of integer variables in minimal inequalities, Composite lifting of group inequalities and an application to two-row mixing inequalities, 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
