CONDITIONAL LOCATION-PROBLEMS ON NETWORKS

被引：32

作者：

BERMAN, O ^{[1
]}

SIMCHILEVI, D ^{[1
]}

机构：

[1] COLUMBIA UNIV,DEPT IND ENGN & OPERAT RES,NEW YORK,NY 10027

来源：

TRANSPORTATION SCIENCE | 1990年 / 24卷 / 01期

关键词：

D O I：

10.1287/trsc.24.1.77

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we describe an algorithm to solve 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. This algorithm can also solve other conditional location problems in which demands are served by the closest facility (new or existing) on networks.

引用

页码：77 / 78

页数：2