Earliest arrival flows with multiple sources

Mathematics of Operations Research

Volumn 34, Issue 2, 2009, Pages 499-512

  Baumann, Nadine ^a   Skutella, Martin ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Earliest arrival flow; Evacuation problem; Flow over time; Network flow

Indexed keywords

COST FLOW; EARLIEST ARRIVAL; EARLIEST ARRIVAL FLOW; EVACUATION PLANNING; EVACUATION PROBLEM; EXACT ALGORITHMS; FLOW OVER TIME; MULTIPLE SOURCE; NETWORK FLOW; RUNNING TIME; SHORTEST PATH ALGORITHMS; SINGLE SOURCE; SINK NODES; SOURCE NODES; TRANSIT TIME;

COST ACCOUNTING;

EID: 67649987999     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0382     Document Type: Article

References (37)

1. Baumann, N., M. Skutella. 2006. Solving evacuation problems efficiently: Earliest arrival flows with multiple sources. Proc. 47th Annual IEEE Sympos. Foundations Comput. Set, Berkeley, CA, 399-408.
2. Berlin, G. N. 1978. The use of directed routes for assessing escape potential. Fire Tech. 14 126-135.
3. Busaker, R. G., P. J. Gowen. 1961. A procedure for determining minimal-cost network flow patterns. Technical Report 15, Operational Research Office, John Hopkins University, Baltimore.
4. Chalmet, L. G., R. L. Francis, P. B. Saunders. 1982. Network models for building evacuation. Management Sci. 28 86-105.
5. Fleischer, L. K. 2001. Faster algorithms for the quickest transshipment problem. SIAM J. Optim. 12 18-35.
6. Fleischer, L., S. Iwata. 2003. A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 131 311-322.
7. Fleischer, L. K., M. Skutella. 2002. The quickest multicommodity flow problem. W. J. Cook, A. S. Schulz, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 2337. Springer, Berlin, 36-53.
8. Fleischer, L. K., M. Skutella. 2007. Quickest flows over time. SIAM J. Comput. 36 1600-1630.
9. Fleischer, L. K., É. Tardos. 1998. Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23 71-80.
10. Ford, L. R., D. R. Fulkerson. 1958. Constructing maximal dynamic flows from static flows. Oper. Res. 6 419-433.
11. Ford, L. R., D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
12. Gale, D. 1959. Transient flows in networks. Michigan Math. J. 6 59-63.
13. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18 30-55.
14. Grötschel, M., L. Lovász, A. Schrijver. 1988. Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, Vol. 2. Springer, Berlin.
15. Hajek, B., R. G. Ogier. 1984. Optimal dynamic routing in communication networks with continuous traffic. Networks 14 457-487.
16. Hamacher, H. W., S. Tifecki. 1987. On the use of lexicographic min cost flows in evacuation modeling. Naval Res. Logist. 34 487-503.
17. Hoppe, B., É. Tardos. 1994. Polynomial time algorithms for some evacuation problems. Proc. 5th Annual ACM-SIAM Sympos. Discrete Algorithms, Arlington, VA, 433-441.
18. Hoppe, B., É. Tardos. 2000. The quickest transshipment problem. Math. Oper. Res. 25 36-62.
19. Iri, M., 1960. A new method of solving transportation-network problems. J. Oper. Res. Soc. Japan 26 27-87.
20. Iwata, S. 2002. A fully combinatorial algorithm for submodular function minimization. J. Combin. Theory, Ser. B 84 203-212.
21. Iwata, S., L. Fleischer, S. Fujishige. 2001. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 761-777.
22. Jarvis, J. J., H. D. Ratliff. 1982. Some equivalent objectives for dynamic network flow problems. Management Sci. 28 106-108.
23. Jewel, P. A. 1958. Optimal flow through networks. Technical Report 8, Operations Research Center, MIT, Cambridge, MA.
24. Klinz, B. 1994. Cited as personal communication in [18].
25. Megiddo, N. 1974. Optimal flows in networks with multiple sources and sinks. Math. Programming 7 97-107.
26. Megiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 414-424.
27. Megiddo, N. 1983. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30 852-865.
28. Minieka, E. 1973. Maximal, lexicographic, and dynamic network flows. Oper. Res. 21 517-527.
29. Nagano, K. 2007. A faster parametric submodular function minimization algorithm and applications. Mathematical Engineering Technical Reports METR 2007-43, University of Tokyo, Japan.
30. Orlin, J. B. 2007. A faster strongly polynomial time algorithm for submodular function minimization. M. Fischetti, D. P. Williamson, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 4513. Springer, Berlin, 240-251.
31. Padberg, M. 1995. Linear Optimization and Extensions. Springer, Berlin.
32. Richardson, D., É. Tardos. 2002. Cited as personal communication in [8].
33. Schrijver, A. 2000. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory, Ser. B 80 346-355.
34. Schrijver, A. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin.
35. Skutella, M. 2009. An introduction to network flows over time. W. Cook, L. Lovász, J. Vygen, eds. Research Trends in Combinatorial Optimization. Springer, Berlin, 451-482.
36. Tjandra, S. 2003. Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, Univeristät Kaiserslautern, Shaker Verlag, Aachen, Germany.
37. Wilkinson, W. L. 1971. An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19 1602-1612.