The minimum weighted covering location problem with distance constraints

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 356-372

  Berman, Oded ^a   Huang, Rongbing ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b YORK UNIVERSITY   (Canada)

Author keywords

Anti covering; Distance constraint; Minimum coverage

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

ANTI-COVERING; CHALLENGING PROBLEM; DISTANCE CONSTRAINTS; MINIMUM COVERAGE;

TRACKING (POSITION);

EID: 34447104591     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.003     Document Type: Article

References (32)

1. Church R.L., and ReVelle C. The maximal covering location problem. Papers of Regional Science Association 32 (1974) 101-118
2. ReVelle C., and Williams J.C. Reserve design and facility siting. In: Drezner Z., and Hamacher H.W. (Eds). Facility location: applications and theory (2002), Springer, Berlin 307-328
3. Tamir A. Obnoxious facility location on graphs. SIAM Journal of Discrete Mathematics 4 4 (1991) 550-567
4. Berman O., and Drezner Z. A note on the location of an obnoxious facility on a network. European Journal of Operational Research 120 (2000) 215-217
5. Church R.L., and Garfinkel R.S. Locating an obnoxious facility on a network. Transportation Science 12 (1978) 107-118
6. Moon I.D., and Chaudhry S. An analysis of network location problems with distance constraints. Management Science 30 (1984) 290-307
7. Kuby M.J. Programming models for facility dispersion: the p-dispersion and maximum dispersion problem. Geographical Analysis 19 (1987) 315-329
8. Erkut E., and Neuman S. Analytical models for locating undesirable facilities. European Journal of Operational Research 40 (1989) 275-291
9. Berman O., Drezner Z., and Wesolowsky G.O. The expropriation location problem. Journal of Operational Research Society 54 (2003) 769-776
10. Drezner Z., and Wesolowsky G. Finding the circle or rectangle containing the minimum weight of points. Location Science 2 (1994) 83-90
11. Berman O., Drezner Z., and Wesolowsky G.O. Minimum covering criterion for obnoxious facility location on a network. Networks 28 (1996) 1-5
12. Toregas C., Swain R., ReVelle C., and Bergman L. The location of emergency service facilities. Operational Research 19 (1971) 1363-1373
13. Schilling D.A., Jayaraman V., and Barkhi R. A review of covering problems in facility location. Location Science 1 (1993) 25-55
14. Orloff C.S. A theoretical model of net accessibility in public facility location. Geographical Analysis 9 (1977) 244-256
15. Murray A.T., Church R.L., Gerrard R.A., and Tsui W.-S. Impact models for siting undesirable facilities. Papers in Regional Science 77 (1998) 19-36
16. Church R.L., and Meandows M.E. Location modeling utilizing maximum service distance criteria. Geographical Analysis 11 (1979) 358-373
17. Gary M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman, New York
18. Chaudhry S., Mccormick S.T., and Moon I.D. Locating independent facilities with maximum weight: greedy heuristics. Omega 14 (1986) 383-389
19. Murray A.T., and Church R.L. Solving the anti-covering location problem using Lagrangian relaxation. Computers and Operational Research 24 (1997) 127-140
20. Nemhauser G.L., and Sigismondi G. A strong cutting plane/branch-and-bound algorithm for node packing. Journal of Operational Research Society 43 (1992) 443-457
21. West D.B. Introduction to graph theory (2001), Prentice-Hall, Englewood Cliffs, NJ
22. Rolland E., Schilling D.A., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 (1996) 329-342
23. Al-Sultan K.S., and Al-Fawzan M.A. A tabu search approach to the uncapacitated facility location problem. Annuals of Operations Research 86 (1999) 91-103
24. Michel L, Van Hentenryck P. A simple tabu search for warehouse location. Technical Report. Brown University: April, CS-02-05; 2002.
25. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Norwell, Massachusetts
26. Narula S.C., Ogbu U.I., and Samuelsson H.M. An algorithm for the p-median problem. Operations Research 25 (1977) 709-713
27. Daskin M.S. Network and discrete location: models, algorithms and applications (1995), Wiley, New York
28. Cornuejols G., Fisher M.L., and Nemhauser G.L. Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science 23 (1977) 789-810
29. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
30. Pirkul H., and Schilling D.A. The maximal covering location problem with capacities on total workload. Management Science 37 (1991) 233-248
31. Schrijver A. Theory of linear and integer programming (1986), Wiley, New York
32. Geoffrion A.M. Lagrangian relaxation for integer programming. Mathematical Programming Study 2 (1974) 82-114