Minimum covering criterion for obnoxious facility location on a network

✍ Scribed by Berman, Oded; Drezner, Zvi; Wesolowsky, George O.

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 381 KB
• Volume: 28
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/(sici)1097-0037(199608)28:1<1::aid-net1>3.0.co;2-j

✦ Synopsis

The objective of this article was to find a location of a new facility on a network so that the total number (weight) of nodes within a prespecified distance R is minimized. This problem is applicable when locating an obnoxious facility such as garbage dumps, nuclear reactors, prisons, and military installations. The paper includes an analysis of the problem, identification of special cases where the problem is easily solved, an algorithm to solve the problem in general, and a sensitivity analysis of R .