Generating facets for the cut polytope of a graph by triangular elimination
From MaRDI portal
Publication:2465651
DOI10.1007/S10107-006-0018-ZzbMath1190.90281arXivmath/0601375OpenAlexW2142464562MaRDI QIDQ2465651
Hiroshi Imai, Tsuyoshi Ito, David Avis
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0601375
Related Items (7)
Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Necessary conditions for extended noncontextuality in general sets of random variables ⋮ On the inequivalence of the CH and CHSH inequalities due to finite statistics ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Lifting and separation procedures for the cut polytope ⋮ On Hilbert bases of cuts ⋮ On the extension complexity of combinatorial polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifting facets of the cut polytope
- Correlation polytopes: Their geometry and complexity
- Quantum probability - quantum logic
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Shelling polyhedral 3-balls and 4-polytopes
- All facets of the cut cone \(C_ n\) for \(n=7\) are known
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Bell’s Theorem for GeneralN-Qubit States
- Facets of the Bipartite Subgraph Polytope
- The cut cone,L1 embeddability, complexity, and multicommodity flows
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- On the cut polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- On the relationship between convex bodies related to correlation experiments with dichotomic observables
- Two-party Bell inequalities derived from combinatorics via triangular elimination
- Geometry of cuts and metrics
This page was built for publication: Generating facets for the cut polytope of a graph by triangular elimination
