BRANCH-AND-BOUND AND APPROXIMATE SOLUTIONS TO CAPACITATED PLANT-LOCATION PROBLEM

被引：61
作者：
SA, G
机构：
来源：
OPERATIONS RESEARCH | 1969年 / 17卷 / 06期
关键词：
D O I：
10.1287/opre.17.6.1005
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
An exact branch-and- bound treatment for the problem is explained, together with an approximate routine for solving the problem. The approximate routine borrow from the 'add' approach of A. A. Kuehn and M. J. Hamburger, and the 'drop' approach of E. Feldman, F. A. Lehrer and T. L. Ray. Empirical evidence is provided suggesting that the branch-and- bound method may be useful in problems of around 25 integer variables.
引用
收藏
页码：1005 / &
相关论文
共 15 条
[1]  
BALINSKI ML, 1960, MATHEMATICA
[2]   A WAREHOUSE-LOCATION PROBLEM [J].
BAUMOL, WJ ;
WOLFE, P .
OPERATIONS RESEARCH, 1958, 6 (02) :252-263
[3]   A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION [J].
EFROYMSON, MA ;
RAY, TL .
OPERATIONS RESEARCH, 1966, 14 (03) :361-+
[4]  
Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670
[5]  
GRAY P, 1967, 6 STANF U DEP OP RES
[6]  
JANDY G, 1967, 673 STANF U OP RES C
[7]  
KENDRICK DA, 1966, THESIS MIT
[8]   A HEURISTIC PROGRAM FOR LOCATING WAREHOUSES [J].
KUEHN, AA ;
HAMBURGER, MJ .
MANAGEMENT SCIENCE, 1963, 9 (04) :643-665
[9]   BRANCH-AND-BOUND METHODS - A SURVEY [J].
LAWLER, EL ;
WOOD, DE .
OPERATIONS RESEARCH, 1966, 14 (04) :699-+
[10]  
LITTLE JDC, 1968, MIT SLOAN SCH MANAGE
12