Rank of random half-integral polytopes — extended abstract —
From MaRDI portal
Publication:2883588
DOI10.1016/j.endm.2010.05.053zbMath1237.52010OpenAlexW2032019147MaRDI QIDQ2883588
Sebastian Pokutta, Gábor Braun
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
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial optimization (90C27)
Cites Work
- Chvátal closures for mixed integer programming problems
- On cutting-plane proofs in combinatorial optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- 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
- Unnamed Item
- Unnamed Item