A fixed point algorithm for solving the euclidean multifacility location problem in a tree

摘要

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.