Maximum Multicommodity Flows over Time without Intermediate Storage

DOI10.1007/978-3-642-33090-2_47zbMath1365.90033OpenAlexW15655054MaRDI QIDQ2912872

Martin Skutella, Martin Groß

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_47

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items

Abstract flows over time: a first step towards solving dynamic packing problems, On the approximability of time disjoint walks, A decomposition-based approach for the multiperiod multiproduct distribution planning problem