Optimal time-varying flows on congested networks
Operations Research
A survey of dynamic network flows
Annals of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Efficient dynamic network flow algorithms
Efficient dynamic network flow algorithms
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
The Quickest Transshipment Problem
Mathematics of Operations Research
Flows over time with load-dependent transit times
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for the Quickest Transshipment Problem
SIAM Journal on Optimization
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum Cost Dynamic Flows: The Series-Parallel Case
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Flows over Time with Load-Dependent Transit Times
SIAM Journal on Optimization
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Approximating earliest arrival flows with flow-dependent transit times
Discrete Applied Mathematics
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
SIAM Journal on Computing
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
Hi-index | 0.00 |
In view of the steadily growing car traffic and the limited capacity of our street networks, we are facing a situation where methods for better traffic management are becoming more and more important. Studies [92] show that an individual "blind" choice of routes leads to travel times that are between 6% and 19% longer than necessary. On the other hand, telematics and sensory devices are providing or will shortly provide detailed information about the actual traffic flows, thus making available the necessary data to employ better means of traffic management.