ON THE CONDITIONAL P-MEDIAN PROBLEM

被引：35
作者：
DREZNER, Z [1 ]
机构：
[1] HONG KONG UNIV SCI & TECHNOL,DEPT MANAGEMENT,KOWLOON,HONG KONG
来源：
COMPUTERS & OPERATIONS RESEARCH | 1995年 / 22卷 / 05期
关键词：
D O I：
10.1016/0305-0548(94)00033-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we investigate the conditional p-median problem. Optimal algorithms for the Euclidean case in the plane for the 1-median with several existing facilities are proposed. A general heuristic algorithm for any metric or environment (network or continuous space) is presented. The algorithm is based on solving several p-median problems.
引用
收藏
页码：525 / 530
页数：6
相关论文
共 28 条
[21]  
JEUL H, 1984, NAVAL RES LOGIST, V31, P9
[22]   A STOPPING RULE FOR FACILITIES LOCATION ALGORITHMS [J].
LOVE, RF ;
YEONG, WY .
AIIE TRANSACTIONS, 1981, 13 (04) :357-362
[23]  
Love RF, 1988, FACILITIES LOCATION
[24]  
LOVE RF, 1987, 4 ISOLDE C NAM
[25]   CONDITIONAL CENTERS AND MEDIANS OF A GRAPH [J].
MINIEKA, E .
NETWORKS, 1980, 10 (03) :265-272
[26]  
Okabe A., 1992, SPATIAL TESSELLATION
[27]   HEURISTIC PROCEDURES FOR THE M-PARTIAL COVER PROBLEM ON A PLANE [J].
WATSONGANDY, CDT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (02) :149-157
[28]  
Weiszfeld E., 1937, TOHOKU MATH J, V43, P335
123