The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Locating a semi-obnoxious facility with expropriation
Computers and Operations Research
Maximizing the number of obnoxious facilities to locate within a bounded region
Computers and Operations Research
Largest empty circle centered on a query line
Journal of Discrete Algorithms
Memetic algorithm for the antibandwidth maximization problem
Journal of Heuristics
A polynomial-time approximation algorithm for a geometric dispersion problem
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
Discrete Optimization
Incremental instant radiosity for real-time indirect illumination
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Variable neighborhood search with ejection chains for the antibandwidth problem
Journal of Heuristics
An improved memetic algorithm for the antibandwidth problem
EA'11 Proceedings of the 10th international conference on Artificial Evolution
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics
Heuristics and metaheuristics for the maximum diversity problem
Journal of Heuristics
Hi-index | 0.00 |
Obnoxious location models are models in which customers no longer consider the facility desirable and try to have it as close as possible to their own location, but instead avoid the facility and stay away from it. Typical applications are optimal locations of nuclear reactors, garbage dumps, or water purification plants. This work presents a survey of mathematical models for undesirable location problems in the plane and particularly on networks; solution procedures are briefly described. A brief review of extensive (obnoxious) facility location problems in networks is also given. Finally critical aspects of existing models are identified and some directions for future search are suggested.