The Weiszfeld Algorithm: Proof, Amendments, and Extensions
From MaRDI portal
Publication:5506731
DOI10.1007/978-1-4419-7572-0_16zbMath1387.90115OpenAlexW134642456MaRDI QIDQ5506731
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_16
Related Items (12)
How bad can the centroid be? ⋮ Continuous location of an assembly station ⋮ Discrete facility location in machine learning ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ Customized alternating direction methods of multipliers for generalized multi-facility Weber problem ⋮ The Fermat-Weber location problem in single integrator dynamics using only local bearing angles ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ Improved fixed point optimality conditions for mixed norms minisum location ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ Unnamed Item ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ ADMM-type methods for generalized multi-facility Weber problem
Cites Work
- A destination optimality in asymmetric distance Fermat-Weber problems
- Solving a huff-like competitive location and design model for profit maximization in the plane
- A new bounding method for single facility location models
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- On the point for which the sum of the distances to \(n\) given points is minimum
- On the convergence of the generalized Weiszfeld algorithm
- Solving general continuous single facility location problems by cutting planes
- The algebraic degree of geometric optimization problems
- The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829
- Optimal location on a sphere
- The Weber problem revisited
- GBSSS: The generalized big square small square method for planar single- facility location
- When facilities coincide: Exact optimality conditions in multifacility location
- Accelerating convergence in the Fermat-Weber location problem
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- On the convergence of the Weiszfeld algorithm
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Convergence of fixed point iteration for deblurring and denoising problem
- Finding the optimal solution to the Huff based competitive location model
- Queueing-location problems on the plane
- On a rational stopping rule for facilities location algorithms
- A quadratically convergent method for minimizing a sum of euclidean norms
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- The Euclidean Multifacility Location Problem
- Location-Allocation Problems
- Weber's problem and weiszfeld's algorithm in general spaces
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Optimal location of a facility relative to area demands
- On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Das verhalten von abstiegsverfahren an einer singularität des gradienten
- A note on accelerating the weiszfeld procedure
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
- Bounding methods for facilities location algorithms
- A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
- Further notes on convergence of the Weiszfeld algorithm
- Decomposition strategies for large-scale continuous location–allocation problems
- Euclidean Constructibility in Graph-Minimization Problems
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- A note on Fermat's problem
- Optimal location of a single facility with circular demand areas
- The Newton bracketing method for convex minimization.
This page was built for publication: The Weiszfeld Algorithm: Proof, Amendments, and Extensions
