OBNOXIOUS FACILITY LOCATION IN THE INTERIOR OF A PLANAR NETWORK*
研究在平面网络中找一个点，使其尽可能远离各弧段和节点，每个弧段或节点可带不同权重，并给出了图解法和计算算法。
ABSTRACT. The problem of locating a point that is as far as possible from arcs and nodes of a network is investigated. Each arc or node may have a different multiplicative factor (weight) for its distance. A graphical solution approach, as well as a computational algorithm, is presented.