A note on accelerating the weiszfeld procedure
From MaRDI portal
Publication:4229660
DOI10.1016/0966-8349(96)00004-6zbMath0916.90178OpenAlexW2076746488MaRDI QIDQ4229660
Publication date: 22 February 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0966-8349(96)00004-6
Related Items
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Extensions to the planar \(p\)-median problem ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Incorporating spatial context into fuzzy-possibilistic clustering using Bayesian inference ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ A sequential Bayesian alternative to the classical parallel fuzzy clustering model ⋮ A heuristic method for large-scale multi-facility location problems ⋮ Weiszfeld's method: old and new results ⋮ Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
