On the rank of mixed 0,1 polyhedra.

DOI10.1007/s101070100250zbMath1049.90040OpenAlexW2101620967MaRDI QIDQ5957572

Yanjun Li, Cornuéjols, Gérard

Publication date: 18 June 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100250

zbMATH Keywords

rankdisjunctive cutmixed 0,1 programmixed integer cutsplit cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Related Items

MIPping closures: An instant survey, MIR closures of polyhedral sets, Tree-width and the Sherali-Adams operator, Theoretical challenges towards cutting-plane selection, On the facets of mixed integer programs with two integer variables and two constraints, Lattice closures of polyhedra, On polytopes with linear rank with respect to generalizations of the split closure, The rank of (mixed-) integer polyhedra, A note on the split rank of intersection cuts, A note on the MIR closure, Relaxations of mixed integer sets from lattice-free polyhedra, Design and Verify: A New Scheme for Generating Cutting-Planes, Cutting planes from extended LP formulations, Design and verify: a new scheme for generating cutting-planes, Projected Chvátal-Gomory cuts for mixed integer linear programs, Relaxations of mixed integer sets from lattice-free polyhedra, Split closure and intersection cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Split cuts and extended formulations for mixed integer conic quadratic programming, Valid inequalities for mixed integer linear programs, On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank