Faster algorithms for the quickest transshipment problem

SIAM Journal on Optimization

Volumn 12, Issue 1, 2002, Pages 18-35

  Fleischer, Lisa K ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Dynamic network flows; Parametric flow; Polynomial time algorithms; Transshipment problem

Indexed keywords

EID: 0036345461     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497327295     Document Type: Article

References (29)

1. A continuous-time network simplex algorithm
2. A survey of dynamic network flows
3. The quickest flow problem
4. Universally maximum flow with piecewise constant capacities
5. Optimal rounding of instantaneous fractional flows over time
6. Efficient continuous-time dynamic network flow algorithms
7. A fast parametric maximum flow algorithm and applications
8. Beyond the flow decomposition barrier
9. A new approach to the maximum flow problem
10. Finding minimum-cost circulations by canceling negative cycles
11. Optimal dynamic routing in communication networks with continuous traffic
12. The quickest transshipment problem
13. Minimum cost dynamic flows: The series-parallel case
14. Optimal flows in networks with multiple sources and sinks
15. Maximal, lexieographic, and dynamic network flows
16. An optimal control approach to dynamic routing in networks
17. Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities
18. Maximum-throughput dynamic network flows
19. Minimum convex cost dynamic network flows
20. Continuous-time flows in networks
21. Stochastic and dynamic networks and routing
22. An algorithm for a class of continuous linear programs
23. A study of general dynamic network programs with arc time-delays
24. Parametric flows, weighted means of cuts, and fractional combinatorial optimization
25. Optimal congestion control in single destination networks
26. An algorithm for universal maximal dynamic flows in a network