The \(k\)-splittable flow problem

DOI10.1007/s00453-005-1167-9zbMath1086.90007OpenAlexW2735337572MaRDI QIDQ818654

Martin Skutella, Ekkehard Köhler, Georg Baier

Publication date: 21 March 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1167-9

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (22)

Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Complexity and approximability of \(k\)-splittable flows ⋮ A polynomial time approximation algorithm for the two-commodity splittable flow problem ⋮ Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Conveyor operations in distribution centers: modeling and optimization ⋮ Quantitative analysis of flow distributions in a multiuser telecommunication network ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network ⋮ Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem ⋮ (Arc-)disjoint flows in networks ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ 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 ⋮ Approximating the \(k\)-splittable capacitated network design problem ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Single-source \(k\)-splittable min-cost flows ⋮ The continuous maximum capacity path interdiction problem ⋮ Single source unsplittable flows with arc-wise lower and upper bounds

This page was built for publication: The \(k\)-splittable flow problem