EFFICIENT ALGORITHMS FOR THE CAPACITATED CONCENTRATOR LOCATION PROBLEM

被引：120
作者：
PIRKUL, H
机构：
来源：
COMPUTERS & OPERATIONS RESEARCH | 1987年 / 14卷 / 03期
关键词：
D O I：
10.1016/0305-0548(87)90022-0
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
引用
收藏
页码：197 / 208
页数：12
相关论文
共 33 条
[11]  
Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670
[12]   DATABASE LOCATION IN COMPUTER-NETWORKS [J].
FISHER, ML ;
HOCHBAUM, DS .
JOURNAL OF THE ACM, 1980, 27 (04) :718-735
[13]   MODELS FOR CONFIGURING LARGE-SCALE DISTRIBUTED COMPUTING SYSTEMS [J].
GAVISH, B .
AT&T TECHNICAL JOURNAL, 1985, 64 (02) :491-532
[14]   TOPOLOGICAL DESIGN OF CENTRALIZED COMPUTER-NETWORKS - FORMULATIONS AND ALGORITHMS [J].
GAVISH, B .
NETWORKS, 1982, 12 (04) :355-377
[15]   OBTAINING BEST MULTIPLIERS FOR A LAGRANGEAN RELAXATION FOR INTEGER PROGRAMMING [J].
GAVISH, B .
COMPUTERS & OPERATIONS RESEARCH, 1978, 5 (01) :55-71
[16]  
Gavish H. P. B., 1982, MANAGEMENT DISTRIBUT, P215
[17]   LAGRANGEAN RELAXATION APPLIED TO CAPACITATED FACILITY LOCATION PROBLEMS [J].
GEOFFRION, A ;
MCBRIDE, R .
AIIE TRANSACTIONS, 1978, 10 (01) :40-47
[18]   DIRECT DUAL METHOD FOR THE MIXED PLANT LOCATION PROBLEM WITH SOME SIDE CONSTRAINTS [J].
GUIGNARD, M ;
SPIELBERG, K .
MATHEMATICAL PROGRAMMING, 1979, 17 (02) :198-228
[19]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[20]   TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].
HELD, M ;
KARP, RM .
OPERATIONS RESEARCH, 1970, 18 (06) :1138-&
1234