Random half-integral polytopes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- 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
- Graph Theory and Probability
- 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
- Outline of an algorithm for integer solutions to linear programs
- Probability and Computing
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Valid inequalities for mixed integer linear programs
Cited in
(2)
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)