Polyhedra related to undirected multicommodity flows
From MaRDI portal
Publication:1119951
DOI10.1016/0024-3795(89)90468-0zbMath0672.05077OpenAlexW2093030792MaRDI QIDQ1119951
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90468-0
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph theory (05C99)
Related Items
Minimum cost multiflows in undirected networks ⋮ Applications of cut polyhedra. II ⋮ Path packing and a related optimization problem ⋮ On the fractionality of the path packing problem ⋮ Min-cost multiflows in node-capacitated undirected networks ⋮ Metric packing for \(K_ 3 + K_ 3\) ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ On return path packing. ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ On duality and fractionality of multicommodity flows in directed networks ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Sums of cuts and bipartite metrics ⋮ Tight spans of distances and the dual fractionality of undirected multiflow problems ⋮ On one maximum multiflow problem and related metrics
Cites Work
- Half-integral five-terminus flows
- Combinatorial approaches to multiflow problems
- Über die Maximalzahl kantendisjunkter A-Wege
- On the Extreme Rays of the Metric Cone
- 2-Matchings and 2-covers of hypergraphs
- Multi-Commodity Network Flows
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polyhedra related to undirected multicommodity flows