The hypermetric cone is polyhedral

DOI10.1007/BF01303512MaRDI QIDQ1316645zbMATHFDO

Authors Viacheslav Grishukhin, Michel Deza, Monique Laurent

Publication date 1 December 1994

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

lattice polytopesquadratic formspolyhedral conehypermetric

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 780781
• The Hypermetric Cone on Seven Vertices
• The hypermetric cone and polytope on eight vertices and some generalizations
• The hypermetric cone and polytope on graphs
• The decomposition of the hypermetric cone into \(L\)-domains

Cites work

• scientific article; zbMATH DE number 426331 (Why is no real title available?)
• 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
• On the Extreme Rays of the Metric Cone
• Sur les inégalités valides dans \(L^ 1\)
• The Empty Sphere
• The classification of finite connected hypermetric spaces
• The cut cone,L1 embeddability, complexity, and multicommodity flows
• Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee

Cited in

(28)

• Complexity results for the gap inequalities for the max-cut problem
• The hypermetric cone and polytope on graphs
• The Hypermetric Cone on Seven Vertices
• Delaunay transformations of a Delaunay polytope
• A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• scientific article; zbMATH DE number 426331 (Why is no real title available?)
• scientific article; zbMATH DE number 780781 (Why is no real title available?)
• Semidefinite programming and combinatorial optimization
• The six-dimensional Delaunay polytopes
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
• The decomposition of the hypermetric cone into \(L\)-domains
• On a class of metrics related to graph layout problems
• Small Cones of Oriented Semi-Metrics
• Application of cut polyhedra. I
• Applications of cut polyhedra. II
• Zonoid theory and Hilbert's fourth problem
• Binary positive semidefinite matrices and associated integer polytopes
• The Boolean quadric polytope
• Lattice-free polytopes and their diameter
• Membership testing for Bernoulli and tail-dependence matrices
• Facets for the cut cone. I
• Facets for the cut cone. II: Clique-web inequalities
• Supporting cone of a polyhedron
• Finite metric spaces of strictly negative type
• 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)