On the Rank of Cutting-Plane Proof Systems

DOI10.1007/978-3-642-13036-6_34zbMath1284.03260OpenAlexW2125541192MaRDI QIDQ3569838

Sebastian Pokutta, Andreas S. Schulz

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_34

zbMATH Keywords

cutting planesproof systemslift-and-project cutssplit cutsGomory-Chvátal cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Complexity of proofs (03F20)

Related Items (9)

Rank of random half-integral polytopes — extended abstract — ⋮ Theoretical challenges towards cutting-plane selection ⋮ Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators ⋮ Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank ⋮ Random half-integral polytopes ⋮ Design and Verify: A New Scheme for Generating Cutting-Planes ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set

This page was built for publication: On the Rank of Cutting-Plane Proof Systems