Solving evacuation problems efficiently Earliest arrival flows with multiple sources

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 399-408

  Baumann, Nadine ^a   Skutella, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIALS; REQUIREMENTS ENGINEERING; SET THEORY;

EARLIEST ARRIVAL FLOWS; EVACUATION PLANNING; MINCOST FLOW COMPUTATIONS; SUCCESSIVE SHORTEST PATH ALGORITHM;

PROBLEM SOLVING;

EID: 38749116609     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.70     Document Type: Conference Paper

References (31)

1. G. N. Berlin. The use of directed routes for assessing escape potential. National Fire Protection Association, Boston, MA, 1979.
2. R. G. Busaker and P. J. Gowen. A procedure for determining minimal-cost network flow patterns. Technical Report 15, Operational Research Office, John Hopkins University, Baltimore, MD, 1961.
3. L. G. Chalmet, R. L. Francis, and P. B. Saunders. Network models for building evacuation. Management Science, 28:86-105, 1982.
4. L. K. Fleischer. Faster algorithms for the quickest transshipment problem. SIAM Journal on Optimization, 12:18-35, 2001.
5. L. K. Fleischer and M. Skutella. Quickest flows over time. SIAM Journal on Computing. To appear.
6. L. K. Fleischer and M. Skutella. The quickest multicommodity flow problem. In W. J. Cook and A. S. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 36-53. Springer, Berlin, 2002.
7. L. K. Fleischer and E. Tardos. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23:71-80, 1998.
8. L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
9. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
10. D. Gale. Transient flows in networks. Michigan Mathematical Journal, 6:59-63, 1959.
11. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988.
12. B. Hajek and R. G. Ogier. Optimal dynamic routing in communication networks with continuous traffic. Networks, 14:457-487, 1984.
13. H. W. Hamacher and S. Tifecki. On the use of lexico-graphic min cost flows in evacuation modeling. Naval Research Logistics, 34:487-503, 1987.
14. B. Hoppe and É. Tardos. Polynomial time algorithms for some evacuation problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 433-441, Arlington, VA, 1994.
15. B. Hoppe and E. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36-62, 2000.
16. M. Iri. A new method of solving transportation-network problems. Journal of the Operations Research Society of Japan, 26:27-87, 1960.
17. S. Iwata. A fully combinatorial algorithm for submodular function minimization. Journal of Combinatorial Theory, Ser. B, 84:203-212, 2002.
18. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48:761-777, 2001.
19. J. Jarvis and H. Ratliff. Some equivalent objectives for dynamic network flow problems. Management Science, 28:106-108, 1982.
20. P. A. Jewel. Optimal flow through networks. Technical Report 8, Operations Research Center, MIT, Cambridge, MA, 1958.
21. B. Klinz. Cited as personal communication (1994) in [15].
22. S. T. McCormick and M. Queyranne. Finding all optimal solutions for submodular function minimization. Talk given at Oberwolfach workshop ID 0545 on Combinatorial Optimization, November 2005.
23. N. Megiddo. Optimal flows in networks with multiple sources and sinks. Mathematical Programming, 7:97-107, 1974.
24. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4:414-424, 1979.
25. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30:852-865, 1983.
26. E. Minieka. Maximal, lexicographic, and dynamic network flows. Operations Research, 21:517-527, 1973.
27. D. Richardson and E. Tardos. Cited as personal communication (2002) in [5].
28. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80:346-355, 2000.
29. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin, 2003.
30. S. Tjandra. Dynamic Network Optimization with Application to the Evacuation Problem. PhD thesis, Univeristät Kaiserslautern, Shaker Verlag, Aachen, 2003.
31. W. L. Wilkinson. An algorithm for universal maximal dynamic flows in a network. Operations Research, 19:1602-1612, 1971.