The Expected Maximum Distance Objective in Facility Location
提出一种新的目标函数用于极小化极大选址问题，每个需求点以给定概率产生服务需求，目标是最小化期望最大距离。平面问题被证明是凸的，可用Excel求解器求解；网络问题则提出了高效算法。
Abstract In this paper we introduce a new objective function for the minimax location problem. Every demand point generates demand for service with a given probability (during a given period of time) and the objective is to minimize the expected maximum distance. The planar problem is proven to be convex and thus standard solution techniques such as using the Solver in Excel can be applied for its solution. Properties for the problem on the network are proven and an efficient algorithm proposed for its solution.