The Quickest Transshipment Problem

References

• Aronson J. E. A survey of dynamic network flows. Ann. Oper. Res. (1989) 20 1 66 Crossref, Google Scholar
• Berlin G. N. The use of directed routes for assessing escape potential. (1979) (National Fire Protection Association, Boston, MA) Google Scholar
• Burkard R. E. , Dlaska K. , Kellerer H. The quickest disjoint flow problem. (1991) . Technical Report 189-91, Institute of Mathematics, University of Technology, Graz, Austria Google Scholar
• Burkard R. E. , Dlaska K. , Klinz B. The quickest flow problem. ZOR Methods and Models of Oper. Res. (1993) 37 1 31 58 Crossref, Google Scholar
• Chalmet L. G. , Francis R. L. , Saunders P. B. Network models for building evacuation. Management Sci. (1982) 28 86 105 Link, Google Scholar
• Chen Y. L. , Chin Y. H. The quickest path problem. Comput. Oper. Res. (1990) 17 153 161 Crossref, Google Scholar
• Choi W. , Francis R. L. , Hamacher H. W. , Tufecki S. , Brans J. P. Network models of building evacuation problems with flow-dependent exit capacities. Proc. 10th Internat. Conf. Oper. Res. (1984) (North-Holland, Amsterdam, The Netherlands) 1047 1059 Google Scholar
• Choi W. , Hamacher H. W. , Tufecki S. Modeling of building evacuation problems by network flows with side constraints. Eur. J. Oper. Res. (1988) 35 98 110 Crossref, Google Scholar
• Deng X. , Liu H. , Xiao B. Deterministic load balancing in computer networks. Proc. 2nd IEEE Symposium on Parallel and Distributed Proc. (1992) Los Angeles, CA 50 57 Google Scholar
• Fizzano P. , Stein C. Scheduling on a ring with unit capacity links. (1994) . Dartmouth College Technical Report PC5-TR94-216, Hanover, NH Google Scholar
• Fleischer L. Faster algorithms for the quickest transshipment problem with zero transit times. SIAM J. Optim. (1999) . Forthcoming Google Scholar
• Fleischer L. , Orlin J. Optimal rounding of fractional dynamic flows when transit times are zero. SIAM J. Discrete Math. (1999) . Forthcoming Google Scholar
• Fleischer L. , Tardos É. Efficient continuous-time dynamic network flow algorithms. Oper. Res. Letters (1998) 23 71 80 Crossref, Google Scholar
• Ford L. R. , Fulkerson D. R. Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Gallo G. , Grigoriadis M. D. , Tarjan R. E. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. (1989) 18 1 30 55 Crossref, Google Scholar
• Goldberg A. V. , Tarjan R. E. A new approach to the maximum-flow problem. J. ACM. (1988) 35 4 921 940 Crossref, Google Scholar
• Grötschel M. , Lovász L. , Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988) (Springer Verlag, Berlin, Germany) Crossref, Google Scholar
• Hajek B. , Ogier R. G. Optimal dynamic routing in communication networks with continuous traffic. Networks (1984) 14 457 487 Crossref, Google Scholar
• Hamacher H. W. , Tufekci S. On the use of lexicographic min cost flows in evacuation modeling. Naval Res. Logist. (1987) 34 487 503 Crossref, Google Scholar
• Hoppe B. Efficient dynamic network flow algorithms. (1995) . Ph.D. Thesis, Cornell University. Department of Computer Science Technical Report TR95-1524, Ithaca, NY Google Scholar
• Hoppe B. , Tardos É. Polynomial time algorithms for some evacuation problems. Proc. 5th Ann. ACM-SIAM Symposium Discrete Algorithms (1994) Philadelphia, PA 433 441 Google Scholar
• Hoppe B. , Tardos É. The quickest transshipment problem. Proc. 6th Ann. ACM-SIAM Symposium Discrete Algorithms (1995) 512 521 Google Scholar
• Hung Y.-C. , Chen G.-H. On the quickest path problem. Proc. ICCI Lecture Notes in Comput. Sci. 497 (1991) (Springer-Verlag, Berlin, Germany) 44 46 Crossref, Google Scholar
• Jarvis J. R. , Ratliff D. H. Some equivalent objectives for dynamic network flow problems. Management Sci. (1982) 28 106 109 Link, Google Scholar
• Kagaris D. , Pantziou G. E. , Tragoudas S. , Zaroliagis C. D. , Akl S. G. , Dehne F. , Sack J.-R. , Santoro N. On the computation of fast data transmissions in networks with capacities and delays. Proc. Workshop Algorithms Data Structures Series (1995) 955 (Springer Verlag, Berlin, Germany) Lecture Notes in Computer Science Crossref, Google Scholar
• Klinz B. Personal communication. (1994) Google Scholar
• Megiddo N. Optimal flows in networks with multiple sources and sinks. Math. Programming (1974) 7 97 107 Crossref, Google Scholar
• Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4 414 424 Link, Google Scholar
• Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM (1983) 30 852 865 Crossref, Google Scholar
• Minieka E. Maximal, Lexicographic, and Dynamic Network Flows. Oper. Res. (1973) 21 517 527 Link, Google Scholar
• Phillips C. , Stein C. , Wein J. Task scheduling in networks. SIAM J. Discrete Math. (1997) 10 4 573 597 Crossref, Google Scholar
• Powell W. B. , Jaillet P. , Odoni A. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Stochastic and dynamic networks and routing. Handbooks in Operations Research and Management Science Network Routing (1999) 8 (Elsevier Science Publishers B.V., North Holland) 141 295 Google Scholar
• Queyranne M. A combinatorial algorithm for minimizing symmetric submodular functions. Proc. 6th Ann. ACM-SIAM Symposium Discrete Algorithms (1995) 98 101 Google Scholar
• Rosena J. B. , Sun S.-Z. , Xue G.-L. Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. (1991) 18 579 584 Crossref, Google Scholar
• Vaidya P. M. A new algorithm for minimizing convex functions over convex sets. Proc. 30th Ann. IEEE Symposium Foundations Comput. Sci. (1989) Crossref, Google Scholar