Minimum covering criterion for obnoxious
β
Berman, Oded; Drezner, Zvi; Wesolowsky, George O.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 381 KB
π 1 views
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