A Procedure for Locating Emergency-Service Facilities for All Possible Response Distances
提出一种程序，用于在给定最大距离约束下，确定覆盖所有需求点所需的最少应急服务设施数量，并给出所有可能最大距离下的结果。
The problem of locating emergency-service facilities involves the assignment of a set of demand points to a set of facilities. One way to formulate the problem is to minimize the number of required facilities, given that the maximum distance between the demand points and their nearest facility does not exceed some specified value. We present a procedure for determining the numbers of such facilities for all possible values of the maximum distance. Computational results are presented for a microcomputer implementation.