Location of an Obnoxious Route
研究如何规划一条通过给定点集的路径，使得该路径到各点的最小加权距离最大化，适用于危险品管道布局和机器人路径规划，提出了两种算法。
This problem deals with the location of a route or path through a set of given points in order to maximize the smallest weighted distance from the given points to the route. Applications may include the planning of pipelines carrying noxious material, and also certain problems in robotics. The first algorithm finds a non-linear path by iteratively solving network minimal-cut problems. A second algorithm solves the case where the route is restricted to be linear.