EFFICIENT ALGORITHMS FOR THE CAPACITATED CONCENTRATOR LOCATION PROBLEM

被引:120
作者
PIRKUL, H
机构
关键词
D O I
10.1016/0305-0548(87)90022-0
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:197 / 208
页数:12
相关论文
共 33 条
[1]  
AHUJA V, 1982, DESIGN ANAL COMPUTER
[2]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[3]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[4]   A HEURISTIC LAGRANGEAN ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].
BARCELO, J ;
CASANOVAS, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (02) :212-226
[5]   SURVEY OF VARIOUS TACTICS FOR GENERATING LAGRANGIAN MULTIPLIERS IN THE CONTEXT OF LAGRANGIAN DUALITY [J].
BAZARAA, MS ;
GOODE, JJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (04) :322-338
[6]   LARGE-SCALE NETWORK TOPOLOGICAL OPTIMIZATION [J].
BOORSTYN, RR ;
FRANK, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :29-47
[7]   ON OPTIMAL ALLOCATION IN A DISTRIBUTED-PROCESSING ENVIRONMENT [J].
DUTTA, A ;
KOEHLER, G ;
WHINSTON, A .
MANAGEMENT SCIENCE, 1982, 28 (08) :839-853
[8]   NEWCLUST - ALGORITHM FOR TOPOLOGICAL DESIGN OF 2-LEVEL, MULTIDROP TELEPROCESSING NETWORKS [J].
DYSART, HG ;
GEORGANAS, ND .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1978, 26 (01) :55-62
[9]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009