In this paper we study the following general MaxMinoptimization problem concerning undesirable (obnoxious) facility location: Given a set of n sites S inside a convex region P, construct m garbage deposit sites Vm such that the minimum distance between these sites Vm and the union of S and Vm, Vm∪ S, is maximized. We present a general method using Voronoi diagrams to approximately solve two such problems when the sites S’s are points and weighted convex polygons (correspondingly, Vm‘s are points and weighted points and the distances are L2 and weighted respectively). In the latter case we generalize the Voronoi diagrams for disjoint weighted convex polygons in the plane. Our algorithms run in polynomial time and approximate the optimal solutions of the above two problems by a factor of 2.
CITATION STYLE
Qin, Z., Xu, Y., & Zhu, B. (2000). On some optimization problems in obnoxious facility location. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1858, pp. 320–329). Springer Verlag. https://doi.org/10.1007/3-540-44968-x_32
Mendeley helps you to discover research relevant for your work.