Computing extreme rays of the metric cone for seven points
From MaRDI portal
Publication:1193551
DOI10.1016/0195-6698(92)90021-QzbMath0760.05058OpenAlexW2115502412MaRDI QIDQ1193551
Publication date: 27 September 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(92)90021-q
Extremal problems in graph theory (05C35) Stochastic network models in operations research (90B15) Distance in graphs (05C12)
Related Items
Application of cut polyhedra. I, How good are convex hull algorithms?, Small Cones of Oriented Semi-Metrics, Graphic vertices of the metric polytope, One-third-integrality in the max-cut problem, The hypermetric cone and polytope on eight vertices and some generalizations, The Hypermetric Cone on Seven Vertices, The cut cone. III: On the role of triangle facets, Small cones of \(m\)-hemimetrics, The cut cone. III: On the role of triangle facets, Enumeration of the facets of cut polytopes over some highly symmetric graphs, Quasi-semi-metrics, oriented multi-cuts and related polyhedra, A classification of the six-point prime metrics, The coherency index, The hypermetric cone is polyhedral
Cites Work
