Premium
Minimum covering criterion for obnoxious facility location on a network
Author(s) -
Berman Oded,
Drezner Zvi,
Wesolowsky George O.
Publication year - 1996
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199608)28:1<1::aid-net1>3.0.co;2-j
Subject(s) - facility location problem , identification (biology) , mathematical optimization , computer science , garbage , 1 center problem , sensitivity (control systems) , mathematics , engineering , botany , electronic engineering , biology , programming language
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. © 1996 John Wiley & Sons, Inc.