Maximum multicommodity flows over time without intermediate storage

Authors:
Martin Groß;Martin Skutella
Affiliations:
Fakultät II --- Mathematik und Naturwissenschaften, Institut für Mathematik, Sekr. MA 5-2, Technische Universität Berlin, Berlin, Germany;Fakultät II --- Mathematik und Naturwissenschaften, Institut für Mathematik, Sekr. MA 5-2, Technische Universität Berlin, Berlin, Germany
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 9
Cited 0

A survey of dynamic network flows

Annals of Operations Research
Efficient dynamic network flow algorithms

Efficient dynamic network flow algorithms
The Quickest Transshipment Problem

Mathematics of Operations Research
The Quickest Multicommodity Flow Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimum-cost dynamic flows: The series-parallel case: A preliminary version of this paper appeared in the Proceedings of the 4th International Conference on Integer Programming and Combinatorial Optimization, Springer Lecture Notes in Computer Science 920, 1995, pp. 329–343

Networks
Multicommodity flows over time: Efficient algorithms and complexity

Theoretical Computer Science
Quickest Flows Over Time

SIAM Journal on Computing
Ad hoc solution of the multicommodity-flow-over-time problem

IEEE Transactions on Intelligent Transportation Systems
Efficient continuous-time dynamic network flow algorithms

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flows over time generalize classical "static" network flows by introducing a temporal dimension. They can thus be used to model non-instantaneous travel times for flow and variation of flow values over time, both of which are crucial characteristics in many real-world routing problems. There exist two different models of flows over time with respect to flow conservation: one where flow might be stored temporarily at intermediate nodes and a stricter model where flow entering an intermediate node must instantaneously progress to the next arc. While the first model is in general easier to handle, the second model is often more realistic since in applications like, e.g., road traffic, storage of flow at intermediate nodes is undesired or even prohibited. The main contribution of this paper is a fully polynomial time approximation scheme (FPTAS) for (min-cost) multi-commodity flows over time without intermediate storage. This improves upon the best previously known (2+ε)-approximation algorithm presented 10 years ago by Fleischer and Skutella (IPCO 2002).