The hypermetric cone is polyhedral
DOI10.1007/BF01303512zbMATH Open0801.52009MaRDI QIDQ1316645FDOQ1316645
Viacheslav Grishukhin, Michel Deza, Monique Laurent
Publication date: 1 December 1994
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
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) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- Sur les inégalités valides dans \(L^ 1\)
- Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- The cut cone,L1 embeddability, complexity, and multicommodity flows
- On the Extreme Rays of the Metric Cone
- The classification of finite connected hypermetric spaces
- Computing extreme rays of the metric cone for seven points
- All the facets of the six-point Hamming cone
- Title not available (Why is that?)
- The Empty Sphere
Cited In (26)
- Small Cones of Oriented Semi-Metrics
- Title not available (Why is that?)
- Zonoid theory and Hilbert's fourth problem
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Supporting cone of a polyhedron
- Complexity results for the gap inequalities for the max-cut problem
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Binary positive semidefinite matrices and associated integer polytopes
- On a class of metrics related to graph layout problems
- The Boolean Quadric Polytope
- Semidefinite programming and combinatorial optimization
- Title not available (Why is that?)
- The six-dimensional Delaunay polytopes
- Membership testing for Bernoulli and tail-dependence matrices
- Delaunay transformations of a Delaunay polytope
- A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems
- Lattice-free polytopes and their diameter
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Finite metric spaces of strictly negative type
- The Hypermetric Cone on Seven Vertices
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
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)
