On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems

DOI10.1007/S11750-008-0056-1MaRDI QIDQ1001365zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

convergencelocal decrease methodlocation allocationplanar facility location

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• On the convergence of the generalized Weiszfeld algorithm
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• The convergence of the Weiszfeld algorithm
• A note on convergence in the single facility minisum location problem
• The Fermat-Weber location problem revisited

Cites work

• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• A unified model for Weber problems with continuous and network distances
• Further notes on convergence of the Weiszfeld algorithm
• GBSSS: The generalized big square small square method for planar single- facility location
• Heuristic Methods for Location-Allocation Problems
• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 4074780 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• scientific article; zbMATH DE number 1054765 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• Location theory. A unified approach
• Location-Allocation Problems
• On the convergence of the Weiszfeld algorithm
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited
• Weber problems with alternative transportation systems
• Weber problems with mixed distances and regional demand

Cited in

(17)

• On the convergence of the generalized Weiszfeld algorithm
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
• A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
• A note on convergence in the single facility minisum location problem
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• New models for locating a moving service facility
• Continuous location of an assembly station
• Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
• scientific article; zbMATH DE number 1253061 (Why is no real title available?)
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Solving the 1-median problem on a network with continuous demand and demand surplus
• The ordered capacitated facility location problem
• Cooperative games in facility location situations with regional fixed costs
• Reviewing extensions and solution methods of the planar Weber single facility location problem
• A generalized Weiszfeld method for the multi-facility location problem
• A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem

This page was built for publication: On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems

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