THE MINIMAX‐MIN LOCATION PROBLEM*
研究公共设施选址的新目标函数，即最小化用户到设施的最大与最小距离之差，并给出欧氏和直线距离下的求解算法。
ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and rectilinear distance cases are presented.