The fortified Weiszfeld algorithm for solving the Weber problem
From MaRDI portal
Recommendations
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- On the convergence of the generalized Weiszfeld algorithm
- A note on accelerating the weiszfeld procedure
- scientific article; zbMATH DE number 1131789
Cited in
(20)- The planar multifacility collection depots location problem
- A directional approach to gradual cover
- Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
- scientific article; zbMATH DE number 1460260 (Why is no real title available?)
- scientific article; zbMATH DE number 745241 (Why is no real title available?)
- A semismooth Newton based augmented Lagrangian algorithm for Weber problem
- Sequential location of two facilities: comparing random to optimal location of the first facility
- scientific article; zbMATH DE number 6451396 (Why is no real title available?)
- Efficient methods for goal square Weber location problem
- Single-facility Weber location problem based on the lift metric
- Asymmetric distance location model
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A trajectory based heuristic for the planar \(p\)-median problem
- Extensions to the planar \(p\)-median problem
- Further analysis of the Weber problem
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- An improved algorithm for solving the Weber location problem
- On the probability that the optimal solution of the Weber location problem is at a demand point
- A stochastic leader-follower model in competitive facility location
- Jebelean-Weber's algorithm without spurious factors
This page was built for publication: The fortified Weiszfeld algorithm for solving the Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382641)
