CONDITIONAL LOCATION PROBLEMS ON NETWORKS. TECHNICAL NOTE
提出一种算法，用于解决网络上条件选址问题（如条件p中位数或条件p中心问题），其中需求点由最近设施（现有或新建）服务，只需一次求解对应的(p+1)无条件选址问题。
This paper presents an algorithm for solving conditional location problems (such as the conditional p-median problem or the conditional p-center problem) on networks, where demand points are served by the closest facility whether existing or new. This algorithm requires the one-time solution of a (p + 1)-unconditional corresponding location problem using an appropriate shortest distance matrix.