A note on the location of an obnoxious facility on a network

European Journal of Operational Research

Volumn 120, Issue 1, 2000, Pages 215-217

  Berman, Oded ^a   Drezner, Zvi ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Location; Maximin problem; Network; Obnoxious facility

Indexed keywords

EID: 0000006470     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00237-9     Document Type: Article

References (12)

1. R.L. Church, R.S. Garfinkel, Locating an obnoxious facility on a network, Transportation Science 12 (1978) 107-118.
2. Z. Drezner, G.O. Wesolowsky, Location of an obnoxious facility with rectangular distances, Journal of Regional Science 23 (1983) 241-248.
3. Z. Drezner, G.O. Wesolowsky, Location of multiple obnoxious facilities, Transportation Science 19 (1985) 193-202.
4. E. Erkut, S. Neuman, Analytical models for locating undesirable facilities, European Journal of Operational Research 40 (1989) 275-291.
5. E. Melachrinoudis, T.P. Cullinane, Locating an obnoxious facility within a polygonal region, Annals of Operations Research 6 (1986) 137-145.
6. M.I. Shamos, D. Hoey, Closest point problems, in: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975, pp. 151-162.
7. P. Hansen, D. Peeters, J.-F. Thisse, On the location of an obnoxious facility, Sistemi Urbani 3 (1981) 299-317.
8. J.N. Hooker, R.S. Garfinkel, C.K. Chen, Finite dominating sets for network location problems, Operations Research 39 (1991) 100-118.
9. S.E. Dreyfus, A.M. Law, The art and theory of dynamic programming, in: Mathematics in Science and Engineering, vol. 130, Academic Press, New York, 1977.
10. R.W. Floyd, Algorithm 97: Shortest path, Communications of ACM 5 (1962) 345.
11. W.I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, NJ, 1969.
12. 3 and related problems, SIAM Journal on Computing 12 (1983) 759-776.