EFFICIENT COMPUTATIONAL PROCEDURE FOR SOLVING MULTI-FACILITY RECTILINEAR FACILITIES LOCATION PROBLEM

被引:12
作者
JUEL, H
LOVE, RF
机构
[1] MICHIGAN TECHNOL UNIV,HOUGHTON,MI 49931
[2] UNIV WISCONSIN,MILWAUKEE,WI 53201
[3] UNIV WATERLOO,WATERLOO,ONTARIO,CANADA
关键词
D O I
10.2307/3009078
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:697 / 7033
页数:6337
相关论文
共 10 条
[1]  
CABOT AV, 1970, AIIE T, V2, P132
[2]  
JUEL H, 1975, 3 U WISC GRAD SCH BU
[3]   SOLVING CONSTRAINED MULTI-FACILITY LOCATION PROBLEMS INVOLVING LP DISTANCES USING CONVEX PROGRAMMING [J].
LOVE, RF ;
MORRIS, JG .
OPERATIONS RESEARCH, 1975, 23 (03) :581-587
[4]   DUAL OF A HYPERBOLIC APPROXIMATION TO GENERALIZED CONSTRAINED MULTI-FACILITY LOCATION PROBLEM WITH LP DISTANCES [J].
LOVE, RF .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 21 (01) :22-33
[5]  
LOVE RF, 1976, INTERFACES, V6
[6]  
PRITSKER AAB, 1971, AIIE T, V3, P2
[7]  
PRITSKER AAB, 1970, AIIE T, V2, P290
[8]  
Rao M. R., 1973, AIIE Transactions, V5, P256, DOI 10.1080/05695557308974910
[9]   OPTIMAL LOCATION OF NEW FACILITIES USING RECTANGULAR DISTANCES [J].
WESOLOWSKY, GO ;
LOVE, RF .
OPERATIONS RESEARCH, 1971, 19 (01) :124-+
[10]  
WESOLOWSKY GO, UNPUBLISHED PAPER