The planar multiple obnoxious facilities location problem: A Voronoi based heuristic
Consider a situation where a given number of facilities must be located in a convex polygon with the objective of maximizing the minimum distance between facilities and a given set of communities subject to the facilities being farther than a certain distance from one another. This continuous multip...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier Ltd
2019
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |