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

DOI10.1016/0096-3003(91)90013-DzbMath0757.90046MaRDI QIDQ1178313

Giancarlo Pesamosca

Publication date: 26 June 1992

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

optimality conditionsEuclidean multifacility locationWeber problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quadratically convergent method for minimizing a sum of euclidean norms
• The Euclidean Multifacility Location Problem
• Technical Note—Minisum I_p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on optimality conditions for the Euclidean. Multifacility location problem
• Link-Length Minimization in Networks
• On the solution of the generalized steiner problem by the subgradient method

This page was built for publication: A fixed point algorithm for solving the Euclidean multifacility location problem in a tree