On the Extreme Rays of the Metric Cone
From MaRDI portal
Publication:3921264
DOI10.4153/CJM-1980-010-0zbMath0468.05049MaRDI QIDQ3921264
Publication date: 1980
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Polytopes and polyhedra (52Bxx)
Related Items
Combinatorial approaches to multiflow problems, Routing of uncertain traffic demands, Application of cut polyhedra. I, Rigid pentagons in hypercubes, The cut cone,L1 embeddability, complexity, and multicommodity flows, Group algebra of characteristic 1 and invariant distances over a finite group, Linearly rigid metric spaces., Graphic vertices of the metric polytope, Orders and polytropes: matrix algebras from valuations, Polyhedra related to undirected multicommodity flows, One-third-integrality in the max-cut problem, Model risk in credit risk, Metric packing for \(K_ 3 + K_ 3\), The structure of distances in networks, A canonical decomposition theory for metrics on a finite set, On ideal clutters, metrics and multiflows, Computing extreme rays of the metric cone for seven points, Statistical properties of the single linkage hierarchical clustering estimator, The cut cone. III: On the role of triangle facets, The cut cone. III: On the role of triangle facets, Multiperiod network design with incremental routing, Half-integral five-terminus flows, On the binary solitaire cone, Optimal solution of the discrete cost multicommodity network design problem, Sums of cuts and bipartite metrics, Metrics with finite sets of primitive extensions, A classification of the six-point prime metrics, The coherency index, Exact solution of multicommodity network optimization problems with general step cost functions, Metrics and undirected cuts, The hypermetric cone is polyhedral
