EXTENSIONS TO A LAGRANGEAN RELAXATION APPROACH FOR THE CAPACITATED WAREHOUSE LOCATION PROBLEM

被引:89
作者
CHRISTOFIDES, N
BEASLEY, JE
机构
关键词
D O I
10.1016/0377-2217(83)90179-0
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:19 / 28
页数:10
相关论文
共 16 条
[1]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[2]  
Bilde O., 1977, ANN DISCRETE MATH, V1, P79
[3]   A TREE-SEARCH ALGORITHM FOR THE PARA-MEDIAN PROBLEM [J].
CHRISTOFIDES, N ;
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 10 (02) :196-204
[4]  
DAVIS PS, 1969, NAV RES LOGIST Q, V16, P331
[5]  
ELLWEIN LB, 1971, AIIE T, V3, P290
[6]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009
[7]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345
[8]   LAGRANGEAN RELAXATION APPLIED TO CAPACITATED FACILITY LOCATION PROBLEMS [J].
GEOFFRION, A ;
MCBRIDE, R .
AIIE TRANSACTIONS, 1978, 10 (01) :40-47
[9]   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
[10]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223