A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem

DOI10.1051/ro/2015022zbMath1333.90076OpenAlexW2236064640MaRDI QIDQ2798126

Marilis Bahr Karam Venceslau, Helder Manoel Venceslau, Adilson Elias Xavier, Nelson F. Maculan

Publication date: 1 April 2016

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015022

zbMATH Keywords

location problemlocal convergenceWeiszfeld algorithmFermat-Weber problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Continuous location (90B85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and nonlinear programming.
• The Weber problem revisited
• Accelerating convergence in the Fermat-Weber location problem
• The convergence of the Weiszfeld algorithm
• The Fermat-Weber location problem revisited
• Locational analysis: highlights of growth to maturity
• Location-Allocation Problems
• Further notes on convergence of the Weiszfeld algorithm

This page was built for publication: A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem