A survey of dynamic network flows
Annals of Operations Research
Continuous-time flows in networks
Mathematics of Operations Research
An algorithm for a class of continuous linear programs
SIAM Journal on Control and Optimization
Efficient dynamic network flow algorithms
Efficient dynamic network flow algorithms
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for the quickest transshipment problem with zero transit times
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Study of General Dynamic Network Programs with Arc Time-Delays
SIAM Journal on Optimization
Operations Research Letters
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Time-Expanded Graphs for Flow-Dependent Transit Times
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Discrete Applied Mathematics
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Existence and uniqueness of equilibria for flows over time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Strong duality for the maximum Borel flow problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Survey: Facility location dynamics: An overview of classifications and applications
Computers and Industrial Engineering
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Maximum multicommodity flows over time without intermediate storage
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Approximating earliest arrival flows in arbitrary networks
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Temporal network optimization subject to connectivity constraints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Earliest arrival flows in networks with multiple sinks
Discrete Applied Mathematics
| Hi-index | 0.00 |
We extend discrete-time dynamic flow algorithms presented in the literature to solve the analogous continuous-time dynamic flow problems. These problems include finding maximum dynamic flows, quickest flows, universally maximum dynamic flows, lexicographically maximum dynamic flows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.