Minimum Cost Dynamic Flows: The Series-Parallel Case

Flows over time with load-dependent transit times

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Minimum cost flows over time without intermediate storage

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

The Quickest Multicommodity Flow Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

The Maximum Energy-Constrained Dynamic Flow Problem

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory

Traffic Networks and Flows over Time

Algorithmics of Large and Complex Networks

Multicommodity flows over time: efficient algorithms and complexity

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs11This research has been supported by the Spezialforschungsbereich F 003 ``Optimierung und Kontrolle", Projektbereich Diskrete Optimierung.

Operations Research Letters