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

被引:60
作者
SA, G
机构
关键词
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 条