The \(k\)-splittable flow problem

DOI10.1007/s00453-005-1167-9zbMath1086.90007MaRDI 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

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

Related Items

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