An O(mn) algorithm for the 1-maximin problem on a network

Computers and Operations Research

Volumn 26, Issue 9, 1999, Pages 849-869

  Melachrinoudis, Emanuel ^a   Zhang, Frank GuangSheng ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b MORGAN STANLEY   (United States)

Author keywords

Maximin problem; Network location; Undesirable facilities

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

WEIGHTED DISTANCE;

OPERATIONS RESEARCH;

ALGORITHM; COMPUTER SYSTEM;

EID: 0033178954     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00099-9     Document Type: Article

References (28)

1. Francis RL, McGinnis LF, White JA. Facility Location and Layout: An Analytical Approach, 3rd Ed., Englewood Cliffs, NJ: Prentice-Hall, 1993.
2. Mirchandani PB, Francis RL, editors. Discrete Location Theory. New York: Wiley, 1990.
3. Evans JR, Minieka E. Optimization for Networks and Graphs, 2nd Ed., New York: Marcel Dekker, 1992.
4. Hakimi SL. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 1964;11:450-9.
5. Hakimi SL, Schmeichel EF, Pierce JG. On p-centers in networks. Transportation Science 1978;12:1-15.
6. Church L, Garfinkel RS. Locating an obnoxious facility on a network. Transportation Science 1978;12:107-18.
7. Tamir A. Obnoxious facility location on graphs. SIAM Journal Discrete Mathematics 1991;4:550-67.
8. Moon ID. Maximin center of pendant vertices in a tree network. Transportation Science 1989;23:213-6.
9. Shamos MI, Hoey D. Closest-point problems. Proceedings of the 16th Annual Symposium on Foundation of Computer Science 1975;151-62.
10. Dasarathy B, White LJ. A maximin location problem. Operations Research 1980;28:1385-1401.
11. Drezner Z, Wesolowsky GO. A maximin location problem with maximum distance constraints. AIIE Transactions 1980;12:249-52.
12. Melachrinoudis E, Cullinane TP. Locating an undesirable facility within a geographical region using the maximin criterion. Journal of Regional Science 1985;25:115-27.
13. 2. Operations Research Letters 1995;18:25-30.
14. Drezner Z, Wesolowsky GO. The location of an obnoxious facility with rectangular distances. Journal of Regional Science 1983;23:241-8.
15. Mehrez A, Sinuany-Stern Z, Stulman A. An enhancement of the Drezner-Wesolowsky algorithm for single-facility location with maximin of rectilinear distance. Journal of Operational Research Society 1986;37:971-7.
16. Melachrinoudis E, Cullinane TP. Locating an obnoxious facility within a polygonal region. Annals of Operations Research 1986;6:137-45.
17. Melachrinoudis E. An efficient computational procedure for the rectilinear maximin location problem. Transportation Science 1988;22:217-23.
18. Chandrasekaran R, Daughety A. Location on tree networks: p-center and n-dispersion problems. Mathematics of Operations Research 1981;6:50-7.
19. Erkut E. The discrete p-dispersion problem. European Journal of Operational Research 1990;46:48-60.
20. Hillier FS, Lieberman GJ. Introduction to Operations Research, 6th Ed., New York: McGraw Hill, 1995.
21. Garfinkel RS, Neebe AW, Rao MR. The m-center problem: Minimax facility location. Management Science 1977;23:1133-42.
22. Hsu WL, Nemhauser GL. Easy and hard bottleneck location problems. Discrete Applied Mathematics 1979;1:209-15.
23. Berman O, Einav D, Handler G. The zone-constrained location problem on a network. European Journal of Operational Research 1991;53:14-24.
24. Hooker JN, Garfinkel RS, Chen CK. Finite dominating sets for network location problems. Operations Research 1991;3:100-18.
25. Dyer ME. Linear time algorithms for two- and three-variable linear programs. SIAM Journal Computing 1984;13:31-45.
26. Floyd RW. Algorithm 97 (SHORTEST PATH). Communications of the ACM 1962;5:345.
27. Hansen P, Moon ID. Dispersing facilities on a network. ORSA/TIMS National Meeting, Washington, DC, 1988.
28. Blum M, Floyd RW, Pratt VR, Vivest RL, Tarjan AE. Time bounds for selection. Journal of Computing System Science 1972;7:448-61.