Lattices and convex bodies (number-theoretic aspects) (11H06) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)
Recommendations
Cites work
- All the facets of the six-point Hamming cone
- Computing extreme rays of the metric cone for seven points
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- scientific article; zbMATH DE number 426331 (Why is no real title available?)
- On the Extreme Rays of the Metric Cone
- Sur les inégalités valides dans L^ 1
- The classification of finite connected hypermetric spaces
- The cut cone,L1 embeddability, complexity, and multicommodity flows
- The Empty Sphere
- Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
Cited in
(28)- The decomposition of the hypermetric cone into \(L\)-domains
- Zonoid theory and Hilbert's fourth problem
- Supporting cone of a polyhedron
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Lattice-free polytopes and their diameter
- Finite metric spaces of strictly negative type
- Membership testing for Bernoulli and tail-dependence matrices
- A bound on the k-gonality of facets of the hypermetric cone and related complexity problems
- The six-dimensional Delaunay polytopes
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Delaunay transformations of a Delaunay polytope
- scientific article; zbMATH DE number 426331 (Why is no real title available?)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes
- Complexity results for the gap inequalities for the max-cut problem
- The Hypermetric Cone on Seven Vertices
- Small Cones of Oriented Semi-Metrics
- scientific article; zbMATH DE number 780781 (Why is no real title available?)
- The Boolean quadric polytope
- The hypermetric cone and polytope on graphs
- Semidefinite programming and combinatorial optimization
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- On a class of metrics related to graph layout problems
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Binary positive semidefinite matrices and associated integer polytopes
This page was built for publication: The hypermetric cone is polyhedral
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1316645)