Locating an Obnoxious Facility on a Network

Richard L. Church and Robert S. Garfinkel
Additional contact information
Richard L. Church: University of Tennessee, Knoxville
Robert S. Garfinkel: University of Tennessee, Knoxville

Transportation Science, 1978, vol. 12, issue 2, 107-118

Abstract: We deal with the problem of locating a point on a network so as to maximize the sum of its weighted distances to the nodes. It is shown that there is at least one optimal point in a finite set of points which can easily be generated. An algorithm is given for locating an optimal point in this set. When the network is a tree, this set consists of the “dangling” nodes.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.2.107 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:12:y:1978:i:2:p:107-118

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().