Locating a semi-obnoxious covering facility with repelling polygonal regions

Discrete Applied Mathematics

Volumn 161, Issue 16-17, 2013, Pages 2604-2623

  Plastria, Frank ^a   Gordillo, José ^b   Carrizosa, Emilio ^b  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Continuous location; Covering; Euclidean distance; Margin maximization; Push pull; Semi obnoxious facility

Indexed keywords

CONTINUOUS LOCATIONS; COVERING; EUCLIDEAN DISTANCE; PUSH-PULL; SEMI-OBNOXIOUS;

GEOMETRY;

POLYNOMIALS;

EID: 84884288547     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2013.05.010     Document Type: Article

References (34)

1. S. Abravaya, and M. Segal Low complexity algorithms for optimal consumer push-pull partial covering in the plane European Journal of Operational Research 197 2 2009 456 464
2. O. Berman, and Q. Wang Locating semi-obnoxious facilities with expropriation: minisum criterion Journal of the Operational Research Society 58 3 2006 378 390
3. O. Berman, and Q. Wang Locating a semi-obnoxious facility with expropriation Computers & Operations Research 35 2 2008 392 403
4. R. Blanquero, and E. Carrizosa A D.C. biobjective location model Journal of Global Optimization 23 2 2002 139 154
5. Rafael Blanquero, Emilio Carrizosa, and Pierre Hansen Locating objects in the plane using global optimization techniques Mathematics of Operations Research 34 4 2009 837 858
6. E. Carrizosa, and E. Conde A fractional model for locating semi-desirable facilities on networks European Journal of Operational Research 136 1 2002 67 80
7. E. Carrizosa, and F. Plastria Location of semi-obnoxious facilities Studies in Locational Analysis 12 1999 1 27
8. E. Carrizosa, and D. Romero-Morales Attainment of an optimal solution in a semiobnoxious location problem Studies in Locational Analysis 12 1999 41 48
9. Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard, and Hoang Tuy Weber's problem with attraction and repulsion Journal of Regional Science 32 4 1992 467 486
10. N. Cristianini, and J. Shawe-Taylor An Introduction to Support Vector Machines and Other Kernel-based Learning Methods 2000 Cambridge University Press Cambridge
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag Berlin
12. J.M. Díaz-Báñez, F. Hurtado, H. Meijer, D. Rappaport, and J.A. Sellarès The largest empty annulus problem International Journal of Computational Geometry and Applications 13 4 2003 317 325
13. Z. Drezner, and A. Suzuki The big triangle small triangle method for the solution of nonconvex facility location problems Operations Research 52 1 2004 128 135 Cited By (since 1996) 43
14. Z. Drezner, and G.O. Wesolowsky The Weber problem on the plane with some negative weights INFOR 29 1990 87 99
15. H.A. Eiselt, and G. Laporte Objectives in location problems Z. Drezner, Facility Location, A Survey of Application and Methods 1995 Springer New-York 151 180
16. H.W. Hamacher, M. Labbé, S. Nickel, and A.J.V. Skriver Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives Annals of Operations Research 110 1 2002 33 53
17. Pierre Hansen, Nenad Mladenović, and José Moreno Pérez Variable neighbourhood search: methods and applications 4OR 6 2008 319 360
18. A. Jourani, C. Michelot, and M. Ndiaye Efficiency for continuous facility location problems with attraction and repulsion Annals of Operations Research 167 1 2009 43 60
19. E. Karasakal, and D. Nadirler An interactive solution approach for a bi-objective semi-desirable location problem Journal of Global Optimization 42 2 2008 177 199
20. Jakob Krarup, David Pisinger, and Frank Plastria Discrete location problems with push-pull objectives Discrete Applied Mathematics 123 1-3 2002 363 378
21. Jochen Krebs, and Stefan Nickel Extensions to the continuous ordered median problem Mathematical Methods of Operations Research 71 2010 283 306
22. E. Melachrinoudis, and Z. Xanthopulos Semi-obnoxious single facility location in Euclidean space Computers & Operations Research 30 14 2003 2191 2209
23. Stefan Nickel, and Eva-Maria Dudenhöffer Weber's problem with attraction and repulsion under polyhedral gauges Journal of Global Optimization 11 4 1997 409 432
24. Y. Ohsawa Bicriteria Euclidean location associated with maximin and minimax criteria Naval Research Logistics (NRL) 47 7 2000 581 592
25. Y. Ohsawa, F. Plastria, and K. Tamura Euclidean push-pull partial covering problems Computers & Operations Research 33 12 2006 3566 3582
26. Y. Ohsawa, and K. Tamura Efficient location for a semi-obnoxious facility Annals of Operations Research 123 1 2003 173 188
27. Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara Spatial Tessellations: Concepts and Applications of Voronoi Diagrams 1992 John Wiley & Sons, Inc. New York, NY, USA
28. F. Plastria GBSSS: the generalized big square small square method for planar single-facility location European Journal of Operational Research 62 2 1992 163 174
29. F. Plastria Continuous covering location problems Z. Drezner, H.W. Hamacher, Facility Location: Applications and Theory 2002 Springer-Verlag 37 79 (Chapter 2)
30. Michael Ian Shamos, and Dan Hoey Closest-point problems Proceedings of the 16th Annual Symposium on Foundations of Computer Science SFCS'75 1975 IEEE Computer Society Washington, DC, USA 151 162
31. A.J.V. Skriver, and K.A. Andersen The bicriterion semi-obnoxious location (BSL) problem solved by an Ïμ-approximation European Journal of Operational Research 146 3 2003 517 528
32. Hoang Tuy, Faiz Al-Khayyal, and Fangjun Zhou A D.C. optimization method for single facility location problems Journal of Global Optimization 7 1995 209 227
33. V.N. Vapnik Statistical Learning Theory 1998 John Wiley & Sons, Inc.
34. H. Yapicioglu, A.E. Smith, and G. Dozier Solving the semi-desirable facility location problem using bi-objective particle swarm European Journal of Operational Research 177 2 2007 733 749