Random half-integral polytopes

DOI10.1016/j.orl.2011.03.003zbMath1225.90084OpenAlexW2016843015MaRDI QIDQ635514

Sebastian Pokutta, Gábor Braun

Publication date: 19 August 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.03.003

zbMATH Keywords

cutting-plane proceduresrandom half-integral polytopesrank lower bounds

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (1)

Expansion of random 0/1 polytopes

Cites Work

• Chvátal closures for mixed integer programming problems
• Valid inequalities for mixed integer linear programs
• On cutting-plane proofs in combinatorial optimization
• On the Chvátal rank of polytopes in the 0/1 cube
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• On the Matrix-Cut Rank of Polyhedra
• Graph Theory and Probability
• Outline of an algorithm for integer solutions to linear programs
• On the Rank of Cutting-Plane Proof Systems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Probability and Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random half-integral polytopes