On the rank of mixed 0,1 polyhedra.

DOI10.1007/S101070100250MaRDI QIDQ5957572zbMATH OpenOpenAlexFDO

Authors Gérard Cornuéjols, Yanjun Li

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

disjunctive cutmixed 0,1 programmixed integer cutranksplit cut

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1757948
• \(0/1\) polytopes with quadratic Chvátal rank
• On the Chvátal rank of polytopes in the 0/1 cube
• scientific article; zbMATH DE number 4202024
• Bounds on the Chvatal rank of polytopes in the 0/1-cube

Cited in

(27)

• Bounds on the Chvatal rank of polytopes in the 0/1-cube
• Theoretical challenges towards cutting-plane selection
• Split closure and intersection cuts
• Split cuts and extended formulations for mixed integer conic quadratic programming
• On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
• The rank of (mixed-) integer polyhedra
• Lattice closures of polyhedra
• Design and verify: a new scheme for generating cutting-planes
• MIPping closures: An instant survey
• Tree-width and the Sherali-Adams operator
• On the facets of mixed integer programs with two integer variables and two constraints
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• On the matrix-cut rank of polyhedra.
• Design and verify: A new scheme for generating cutting-planes
• scientific article; zbMATH DE number 1757948 (Why is no real title available?)
• 0/1 polytopes with quadratic Chvátal rank
• Cutting planes from extended LP formulations
• Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra
• On polytopes with linear rank with respect to generalizations of the split closure
• A note on the split rank of intersection cuts
• Tight sum-of-squares lower bounds for binary polynomial optimization problems
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• MIR closures of polyhedral sets
• A note on the MIR closure
• Valid inequalities for mixed integer linear programs

This page was built for publication: On the rank of mixed 0,1 polyhedra.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957572)