On the convergence of the generalized Weiszfeld algorithm
From MaRDI portal
Publication:1026601
DOI10.1007/s10479-008-0336-zzbMath1176.90369OpenAlexW2111352009MaRDI QIDQ1026601
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0336-z
Related Items (6)
Location of a distribution center for a perishable product ⋮ Minimizing differences of convex functions with applications to facility location and clustering ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Location with acceleration-deceleration distance ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Location of a moving service facility
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Finding the optimal solution to the Huff based competitive location model
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Replacing continuous demand with discrete demand in a competitive location model
- The central warehouse location problem revisited
This page was built for publication: On the convergence of the generalized Weiszfeld algorithm
