Locating two obnoxious facilities using the weighted maximin criterion

Operations Research Letters

Volumn 34, Issue 1, 2006, Pages 97-105

  Tamir, Arie ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Maximin criteria; Obnoxious facilities; Planar location models

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

MAXMIN CRITERIA; OBNOXIOUS FACILITIES; PLANAR LOCATION MODELS;

SET THEORY;

EID: 28044443622     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.02.004     Document Type: Article

References (41)

1. G. Appa, I. Giannikos, Locating two obnoxious facilities in the plane under the rectilinear metric, LSE OR Working Paper LSE 04-69, London School of Economics, 2004, submitted for publication.
2. M.J. Atallah, and S.R. Kosaraju An efficient parallel algorithm for the row minima of a totally monotone matrix J. Algorithms 13 1992 394 413
3. B. Ben-Moshe, M.J. Katz, and M. Segal Obnoxious facility location: complete service with minimal harm Internat. J. Comput. Geom. Appl. 10 2000 581 592
4. S. Bespamyatnikh Packing two disks in a polygon Comput. Geom. 23 2002 31 42
5. S. Bespamyatnikh, K. Kedem, M. Segal, and A. Tamir Optimal facility location under various distance functions Internat. J. Comput. Geom. Appl. 10 2000 523 534
6. B. Bhattacharya, H. Elgindy, An efficient algorithm for an intersection problem and an application, Technical Report 86-25, Department of Computer and Information Sciences, University of Pennsylvania, 1986.
7. P. Bose, J. Czyzowicz, E. Kranakis, Algorithms for packing two circles in a convex polygon, Proceedings of Japan Conference on Discrete and Computational Geometry (JCDCG'98) pp. 93-103.
8. P. Bose, P. Morin, and A. Vigneron Packing two disks into a polygonal environment J. Discrete Algorithms 2 2004 373 380
9. J. Brimberg, and A. Mehrez Multifacility location using a maximin criterion and rectangular distances Location Sci. 2 1994 11 19
10. B. Chazelle, and l. Guibas Visibility and intersection problems in plane geometry Discrete Comput. Geom. 4 1989 557 581
11. C.K. Chen, and R.S. Garfinkel The generalized diameter of a graph Networks 12 1982 335 340
12. R.L. Church, and R.S. Garfinkel Locating an obnoxious facility on a network Transport. Sci. 12 1978 107 118
13. R. Cole Slowing down sorting networks to obtain faster sorting algorithms J. Assoc. Comput. Mach. 34 1987 200 208
14. Z. Drezner, and G. Wesolowsky A maximin location problem with maximum distance constraints IEE Trans. 12 1980 249 252
15. Z. Drezner, and G. Wesolowsky The location of an obnoxious facility with rectangular distances J. Regional Sci. 23 1983 241 248
16. H. Edelsbrunner, L.J. Guibas, and J. Stolfy Optimal point location in a monotone subdivision SIAM J. Comput. 15 1986 317 340
17. E. Erkut The discrete p-dispersion problem European J. Oper. Res. 46 1990 48 60
18. E. Erkut, and S. Neuman Analytical models for locating undesirable facilities European J. Oper. Res. 40 1989 275 291
19. F. Follert, E. Schomer, J. Sellen, Subquadratic algorithms for the weighted maximin facility location problem, Technical Report, Universitat des Saarlands, Germany; Proceedings of the Seventh Canadian Conference on Computational Geometry, 1995, pp. 1-6.
20. R.J. Fowler, M.S. Paterson, and S.L. Tanimoto Optimal packing and covering in the plane are NP-complete Inform. Process. Lett. 12 1981 133 137
21. G.N. Frederickson, and D.B. Johnson The complexity of selection and ranking in X + Y and matrices with sorted columns J. Comput. System Sci. 24 1982 197 208
22. G.N. Frederickson, and D.B. Johnson Finding kth paths and p-centers by generating and searching good data structures J. Algorithms 4 1983 61 80
23. M.R. Ghouse, and M.T. Goodrich Fast randomized parallel methods for planar convex hull construction Comput. Geom. Theory Appl. 7 1997 219 235
24. I. Giannikos, Optimal location of single and multiple obnoxious facilities: algorithms for the MAXIMIN criterion under different norms, Ph.D. Thesis, London School of Economics and Political Sciences, 1993.
25. M.T. Goodrich, M.R. Ghouse, and J. Bright Sweep methods for parallel computational geometry Algorithmica 15 1996 126 153
26. M.J. Katz, K. Kedem, and M. Segal Improved algorithms for placing undesirable facilities Comput. Oper. Res. 29 2002 1859 1872
27. K. Kedem, R. Livne, J. Pach, and M. Sharir On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles Discrete Comput. Geom. 1 1986 59 71
28. D.G. Kirkpatrick Optimal search in planar subdivisions SIAM J. Comput. 12 1983 28 35
29. Y. Konforti, and A. Tamir The single facility location problem with minimum distance constraints Location Sci. 5 1997 147 163
30. M.J. Kuby Programming models for facility dispersion: the p-dispersion and maximum dispersion problems Geographical Anal. 19 1987 315 329
31. N. Megiddo Applying parallel computation algorithms in the design of serial algorithms J. Assoc. Comput. Mach. 30 1983 852 865
32. N. Megiddo, and A. Tamir New results on the complexity of p-center problems SIAM J. Comput. 12 1983 751 758
33. E. Melachrinoudis, and J.M. Smith An O (mn 2 ) algorithm for the maximin problem in E 2 Oper. Res. Lett. 18 1995 25 30
34. F.P. Preparata, and M.I. Shamos Computational geometry: An Introduction 1985 Springer Berlin, New York
35. C.P. Ranagan, and R. Govindan An O (n log n ) algorithm for a maximin location problem Discrete Appl. Math. 36 1992 203 205
36. N. Sarnak, and R.E. Tarjan Planar point location using persistent search trees Comm. Assoc. Comput. Mach. 29 1986 669 679
37. A. Tamir Obnoxious facility location on graphs SIAM J. Discrete Math. 4 1991 550 567
38. S.S. Ting, Obnoxious facility location problems on networks, Ph.D. Dissertation, The Johns Hopkins University, 1988.
39. G. Toussaint Computing largest empty circles with location constraints Internat. J. Comput. Inform. Sci. 12 1983 347 357
40. L.S. Valiant Parallelism in comparison problems SIAM J. Comput. 4 1975 348 355
41. E. Zemel On search over rationals Oper. Res. Lett. 1 1981 34 38