Probabilistic single obnoxious facility location with fixed budget☆
Highlights
► We investigate the model of probabilistic single obnoxious facility location with fixed budget. ► Properties of the optimal solutions are identified especially under the condition of some specific probability distributions. ► Heuristic solution procedures for solving the model are presented.
References (9)
- et al.
A general model for the undesirable single facility location problem
Operations Research Letters
(2006) - et al.
The expropriation location problem
Journal of Operational Research Society
(2003) - et al.
A probabilistic minimax location problem on the plane
Annals of Operations Research
(2003) - et al.
The expected maximum distance objective in facility location
Journal of Regional Science
(2003)
There are more references available in the full text version of this article.
Cited by (2)
A mathematical model for locating k-obnoxious facilities on a plane
2018, International Journal of Operational Research
Copyright © 2011 Published by Elsevier B.V.