k-neighborly faces of the Boolean quadric polytopes
From MaRDI portal
Recommendations
Cites work
- 0/1-Polytopes. Typical and extremal properties
- All 0-1 polytopes are traveling salesman polytopes
- An orthogonal basis in irreducible projective representations of a symmetric group
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Geometry of cuts and metrics
- Geometry, complexity, and combinatorics of permutation polytopes
- scientific article; zbMATH DE number 6007904 (Why is no real title available?)
- scientific article; zbMATH DE number 1182906 (Why is no real title available?)
- Linear vs. semidefinite extended formulations
- On affine reducibility of combinatorial polytopes
- On random 2-adjacent 0/1-polyhedra
- The cut cone. III: On the role of triangle facets
- The cut polytope and the Boolean quadric polytope
Cited in
(4)- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Boolean quadric polytopes are faces of linear ordering polytopes
- scientific article; zbMATH DE number 431488 (Why is no real title available?)
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
This page was built for publication: \(k\)-neighborly faces of the Boolean quadric polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259296)