Approximating the single source unsplittable min-cost flow problem
From MaRDI portal
Publication:1849529
DOI10.1007/s101070100260zbMath1030.90109OpenAlexW3016000088MaRDI QIDQ1849529
No author found.
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100260
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Paths and cycles (05C38)
Related Items (15)
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Flow constrained minimum cost flow problem ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ An exact approach for the maximum concurrent \(k\)-splittable flow problem ⋮ On the approximation of the single source \(k\)-splittable flow problem ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Approximability of unsplittable shortest path routing problems ⋮ A Note on the Ring Loading Problem ⋮ Single-source \(k\)-splittable min-cost flows ⋮ Minimum-cost single-source 2-splittable flow ⋮ Minimum-Cost Single-Source 2-Splittable Flow ⋮ Single source unsplittable flows with arc-wise lower and upper bounds
This page was built for publication: Approximating the single source unsplittable min-cost flow problem
