AN ITERATIVE ALGORITHM FOR THE MULTIFACILITY MINIMAX LOCATION PROBLEM WITH EUCLIDEAN DISTANCES

被引:4
作者
CHARALAMBOUS, C
机构
关键词
ALGORITHMS;
D O I
10.1002/nav.3800280214
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
An iterative solution method is presented for solving the multifacility location problem with Euclidean distances under the minimax criterion. The iterative procedure is based on the transformation of the multifacility minimax problem into a sequence of squared Euclidean minisum problems which have analytical solutions. Computational experience with the new method is also presented.
引用
收藏
页码:325 / 337
页数:13
相关论文
共 12 条