Locating an Obnoxious Facility on a Network

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.