The volume of relaxed Boolean-quadric and cut polytopes
From MaRDI portal
Publication:1356562
DOI10.1016/0012-365X(95)00343-UzbMath0872.90062OpenAlexW2007998960MaRDI QIDQ1356562
Einar Steingrímsson, Jon Lee, Chun Wa Ko
Publication date: 9 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00343-u
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Boolean programming (90C09)
Related Items
Gaining or losing perspective, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, Experimental validation of volume-based comparison for double-McCormick relaxations, Volume computation for sparse Boolean quadric relaxations, Selected Open Problems in Discrete Geometry and Optimization
Cites Work
- Unnamed Item
- Two poset polytopes
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- On cutting-plane proofs in combinatorial optimization
- Correlation polytopes: Their geometry and complexity
- Facets for the cut cone. I
- Geometric comparison of combinatorial polytopes
- The cut cone. III: On the role of triangle facets
