On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
From MaRDI portal
Publication:1001365
DOI10.1007/s11750-008-0056-1zbMath1154.90531OpenAlexW2028645072MaRDI QIDQ1001365
Frank Plastria, Mohamed Elosmani
Publication date: 17 February 2009
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-008-0056-1
Related Items (8)
Continuous location of an assembly station ⋮ The ordered capacitated facility location problem ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ Cooperative games in facility location situations with regional fixed costs ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GBSSS: The generalized big square small square method for planar single- facility location
- Weber problems with alternative transportation systems
- On the convergence of the Weiszfeld algorithm
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- A unified model for Weber problems with continuous and network distances
- Weber problems with mixed distances and regional demand
- Location Theory
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Further notes on convergence of the Weiszfeld algorithm
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
This page was built for publication: On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems