Quasi-semi-metrics, oriented multi-cuts and related polyhedra
From MaRDI portal
Publication:1582485
DOI10.1006/EUJC.1999.0383zbMATH Open0966.52010OpenAlexW2060789147MaRDI QIDQ1582485FDOQ1582485
Authors: Michel Deza, Elena Deza
Publication date: 6 August 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/26d4bad02ba4e842010826cbab3c7f0e9834ba5f
Recommendations
- Computations of metric/cut polyhedra and their relatives
- Generalized cut and metric polytopes of graphs and simplicial complexes
- scientific article
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- On some recent results in the metric theory of polyhedra
- Some results on quasipolyhedral convexity
- A note on seminormality of cut polytopes
- scientific article; zbMATH DE number 4092276
- scientific article; zbMATH DE number 1556745
Cites Work
- Combinatorial optimization and small polytopes
- The geometry of graphs and some of its algorithmic applications
- Title not available (Why is that?)
- Geometry of cuts and metrics
- Title not available (Why is that?)
- On Quasi-Metric Spaces
- Small min-cut polyhedra
- Directed distance in digraphs: Centers and medians
- Title not available (Why is that?)
- On quasi-metric spaces
- Title not available (Why is that?)
- Graphic vertices of the metric polytope
- Computing extreme rays of the metric cone for seven points
Cited In (12)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- Small Cones of Oriented Semi-Metrics
- Generalized cut and metric polytopes of graphs and simplicial complexes
- Polyhedral structures associated with quasi-metrics
- On generalized discrete metric structures
- On the directed cut cone and polytope
- The cone of quasi-semimetrics and exponent matrices of tiled orders
- Cones and polytopes of generalized metrics
- Solving survivable two-layer network design problems by metric inequalities
- Small cones of \(m\)-hemimetrics
- Group algebra of characteristic 1 and invariant distances over a finite group
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Uses Software
This page was built for publication: Quasi-semi-metrics, oriented multi-cuts and related polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582485)