A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
From MaRDI portal
Publication:980366
DOI10.1016/j.camwa.2009.07.007zbMath1189.90086OpenAlexW1990285857MaRDI QIDQ980366
I. Norman Katz, Steven R. Vogl
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.07.007
Related Items (7)
A generalized Weber problem with different gauges for different regions ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ Weiszfeld's method: old and new results ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- The Weber problem revisited
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- Location-Allocation Problems
- Weber's problem and weiszfeld's algorithm in general spaces
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Local convergence in Fermat's problem
- Heuristic Methods for Location-Allocation Problems
- Link-Length Minimization in Networks
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- A note on Fermat's problem
This page was built for publication: A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
