Minimum covering criterion for obnoxious facility location on a network

Minimum covering criterion for obnoxious facility location on a network

0.00 Avg rating0 Votes
Article ID: iaor2002109
Country: United States
Volume: 28
Issue: 1
Start Page Number: 1
End Page Number: 5
Publication Date: Aug 1996
Journal: Networks
Authors: , ,
Keywords: networks
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.