Single-source \(k\)-splittable min-cost flows
From MaRDI portal
Publication:1015297
DOI10.1016/j.orl.2008.12.004zbMath1159.90320OpenAlexW2088904132MaRDI QIDQ1015297
Publication date: 7 May 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.12.004
approximation algorithmnetwork flowroutingunsplittable flowmulti-commodity flow\(k\)-splittable flow
Related Items (4)
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem ⋮ A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem ⋮ Single source unsplittable flows with arc-wise lower and upper bounds
Cites Work
- The \(k\)-splittable flow problem
- Minimum-cost single-source 2-splittable flow
- On the single-source unsplittable flow problem
- Approximating the single source unsplittable min-cost flow problem
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
- Approximation Algorithms for Single-Source Unsplittable Flow
- Convex Combinations of Single Source Unsplittable Flows
This page was built for publication: Single-source \(k\)-splittable min-cost flows
