The quickest transshipment problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 512-521

  Hoppe, Bruce ^a   Tardos, Éva ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

BUILDING EVACUATION; DYNAMIC NETWORK; DYNAMIC NETWORK FLOW; FLOW OUT; POLYNOMIAL-TIME ALGORITHMS; SINGLE SOURCE; TRANSIT TIME; TRANSSHIPMENT PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 85007217435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Aronson, J.E., A Survey of Dynamic Network Flows, Annals of Operations Research 20(1989)1-66.
2. Burkard, R.E., Dlaska, K. and Klinz, B., The Quickest Flow Problem, ZOR Methods and Models of Operations Research 37:1(1993)31-58.
3. Chalmet, L.G., Francis, R.L. and Saunders P.B., Network Models for Building Evacuation, Management Science 28(1982)86-105.
4. Deng, X., Liu, H., and Xiao, B., Deterministic Load Balancing in Computer Networks, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, 1992, 50-57.
5. Fizzano, P. and Stein, C, Scheduling on a Ring with Unit Capacity Links, Dartmouth College Technical Report PC5-TR94-216.
6. Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton University Press, New Jersey, 1962.
7. Grötschel, M., Lovász, L. and Schrijver, A., Geometric Algorithms and Combinatorial Optimization, Springer Verlag, 1988.
8. Hajek, B. and Ogier, R.G., Optimal Dynamic Routing in Communication Networks with Continuous Traffic, Networks 14(1984)457-487.
9. Hamacher, H.W. and Tufekci, S., On the Use of Lexicographic Min Cost Flows in Evacuation Modeling, Naval Research Logistics 34(1987)487-503.
10. Hoppe, B. and Tardos, É., Polynomial Time Algorithms for Some Evacuation Problems, Proc. 5th Annual ACM-SIAM Symp. Discrete Algorithms, 1994, 433-441.
11. Hoppe, B. and Tardos, E., A Polynomial Time Algorithm for the Integral Evacuation Problem, unpublished manuscript, November 1993.
12. Jarvis, J.R. and Ratliff, D.H., Some Equivalent Objectives for Dynamic Network Flow Problems, Management Science 28(1982)106-109.
13. Klinz, B. Personal communication.
14. Megiddo, N., Optimal Flows in Networks with Multiple Sources and Sinks, Mathematica J Programming 7(1974)97-107.
15. Megiddo, N., Combinatorial Optimization with Rational Objective Functions, Mathematics of Operations Research, 4(1979)414-424.
16. Minieka, E., Maximal, Lexicographic, and Dynamic Network Flows, Operations Research 21(1973)517-527.
17. Phillips, C, Stein, C, and Wein, J., Task Scheduling in Networks, Proc. Fourth Scandinavian Workshop on Algorithm Theory, 1994, 290-301.
18. Powell, W.B., Jaillet, P. and Odoni, A., Stochastic and Dynamic Networks and Routing, in Handbooks in Operations Research and Management Science, Networks, (M.O. Ball, T.L. Magnanti, CL. Monma, G.L. Nemhauser, eds.), Elsevier Science Publishers B.V. (to appear).
19. Vaidya, P.M., A New Algorithm for Minimizing Convex Functions over Convex Sets. Proc. 30th Annual IEEE Symp. on Foundations of Computer Science, 1989, 338-343.