Quickest transshipment problem

Mathematics of Operations Research

Volumn 25, Issue 1, 2000, Pages 36-62

  Hoppe, Bruce ^b   Tardos, Éva ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

DYNAMIC NETWORK; INTEGRAL OPTIMUM FLOW; POLYNOMIAL TIME ALGORITHM; TRANSSHIPMENT PROBLEM;

MATHEMATICAL MODELS;

EID: 0034138344     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.1.36.15211     Document Type: Article

References (35)

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