Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
From MaRDI portal
Publication:3899801
DOI10.1287/opre.29.1.37zbMath0452.90023OpenAlexW2115883569MaRDI QIDQ3899801
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.1.37
convergencefacility locationWeiszfeld algorithmlogisticsmultisource Weber problemWeber problemsepsilonapproximationgeneralized distance functionl-p-distance
Related Items (30)
Solving general continuous single facility location problems by cutting planes ⋮ On an open problem in spherical facility location ⋮ Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993 ⋮ Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ An improved bound for the multifacility location model ⋮ Location and layout planning. A survey ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Locational analysis ⋮ A nonlinear optimization approach for solving facility layout problems ⋮ Local convergence in a generalized Fermat-Weber problem ⋮ A note on the Weber location problem ⋮ A destination optimality in asymmetric distance Fermat-Weber problems ⋮ A globally convergent algorithm for the Euclidean multiplicity location problem ⋮ Weiszfeld's method: old and new results ⋮ A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem ⋮ Local convexity results in a generalized Fermat-Weber problem ⋮ On the convergence of the generalized Weiszfeld algorithm ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon ⋮ Location with acceleration-deceleration distance ⋮ Weber problems with alternative transportation systems ⋮ Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ The convergence of the Weiszfeld algorithm ⋮ A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity ⋮ A note on convergence in the single facility minisum location problem ⋮ Application of decision analysis techniques to the Weber facility location problem ⋮ A globally convergent algorithm for facility location on a sphere ⋮ Backup multifacility location problem with \(l_p\) norm
This page was built for publication: Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
