An improved algorithm for solving the Weber location problem

DOI10.1007/S10288-024-00565-9MaRDI QIDQ6999139zbMATH OpenFDO

Authors Zvi Drezner

Publication date 9 April 2025

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10288-024-00565-9

zbMATH Keywords

solution algorithmWeber problemlocation analysisnon-linear programming

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 5501651 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• scientific article; zbMATH DE number 1094753 (Why is no real title available?)
• scientific article; zbMATH DE number 3246195 (Why is no real title available?)
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• A new heuristic for solving the \(p\)-median problem in the plane
• A new local search for continuous location problems
• A note on accelerating the weiszfeld procedure
• A note on the Weber location problem
• Asymptotic behavior of the Weber location problem on the plane
• Contributions to location analysis. In honor of Zvi Drezner's 75th birthday
• Exact and approximate solutions to the multisource weber problem
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Heuristic Methods for Location-Allocation Problems
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Local convergence in Fermat's problem
• Location-Allocation Problems
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• On the point for which the sum of the distances to n given points is minimum
• Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum.
• The fortified Weiszfeld algorithm for solving the Weber problem

Cited in

(2)

• Reviewing extensions and solution methods of the planar Weber single facility location problem
• On the probability that the optimal solution of the Weber location problem is at a demand point

This page was built for publication: An improved algorithm for solving the Weber location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999139)