A FIXED-POINT ALGORITHM FOR SOLVING THE EUCLIDEAN MULTIFACILITY LOCATION PROBLEM IN A TREE

被引：0
|
作者：
PESAMOSCA, G
机构：
[1] Dip. Metodi e Modelli Matematici Università La Sapienza
来源：
APPLIED MATHEMATICS AND COMPUTATION | 1991年 / 44卷 / 02期
关键词：
D O I：
10.1016/0096-3003(91)90013-D
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The optimality conditions for the euclidean multifacility location problem with m new facilities in a tree are stated as optimality conditions of a certain set of m Weber problems. An algorithm is presented which solves the EMFL problem by iteratively solving such Weber problems.
引用
收藏
页码：105 / 120
页数：16
相关论文
共 50 条
12345