Rank of random half-integral polytopes. Extended abstract

DOI10.1016/J.ENDM.2010.05.053MaRDI QIDQ2883588zbMATH OpenOpenAlexFDO

Authors Gábor Braun, Sebastian Pokutta

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.053

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial optimization (90C27)

Cites work

• 0/1-Polytopes. Typical and extremal properties
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Chvátal closures for mixed integer programming problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Edmonds polytopes and a hierarchy of combinatorial problems
• scientific article; zbMATH DE number 3156817 (Why is no real title available?)
• scientific article; zbMATH DE number 1538119 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• On cutting-plane proofs in combinatorial optimization
• On the rank of cutting-plane proof systems
• Outline of an algorithm for integer solutions to linear programs
• Probability and Computing
• Rank bounds and integrality gaps for cutting planes procedures
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

This page was built for publication: Rank of random half-integral polytopes. Extended abstract

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