Convex Combinations of Single Source Unsplittable Flows
From MaRDI portal
Publication:3527229
DOI10.1007/978-3-540-75520-3_36zbMath1151.90337OpenAlexW1516796751MaRDI QIDQ3527229
Maren Martens, Fernanda Salazar
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_36
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (6)
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks ⋮ A Note on the Ring Loading Problem ⋮ Single-source \(k\)-splittable min-cost flows ⋮ Single source unsplittable flows with arc-wise lower and upper bounds
This page was built for publication: Convex Combinations of Single Source Unsplittable Flows
