Random half-integral polytopes

DOI10.1016/J.ORL.2011.03.003zbMATH Open1225.90084OpenAlexW2016843015MaRDI QIDQ635514FDOQ635514

Authors: Gábor Braun, Sebastian Pokutta 

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

Recommendations

• Threshold phenomena for high-dimensional random polytopes
• On 0-1 polytopes with many facets
• 0/1-Polytopes. Typical and extremal properties
• On the convex hull of random points in a polytope
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

zbMATH Keywords

cutting-plane proceduresrandom half-integral polytopesrank lower bounds

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph Theory and Probability
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Outline of an algorithm for integer solutions to linear programs
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Title not available (Why is that?)
• Valid inequalities for mixed integer linear programs
• Probability and Computing
• Edmonds polytopes and a hierarchy of combinatorial problems
• Chvátal closures for mixed integer programming problems
• Title not available (Why is that?)
• On cutting-plane proofs in combinatorial optimization
• On the Chvátal rank of polytopes in the 0/1 cube
• On the matrix-cut rank of polyhedra.
• On the rank of cutting-plane proof systems

Cited In (2)

• Expansion of random 0/1 polytopes
• Integer feasibility of random polytopes: random integer programs

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

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