Earliest Arrival Flows with Multiple Sources

References

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