Name
Abstract | ||
|---|---|---|
In this paper we consider Weber-like location problems. The objective function is a sum of terms, each a function of the Euclidean
distance from a demand point. We prove that a Weiszfeld-like iterative procedure for the solution of such problems converges
to a local minimum (or a saddle point) when three conditions are met. Many location problems can be solved by the generalized
Weiszfeld algorithm. There are many problem instances for which convergence is observed empirically. The proof in this paper
shows that many of these algorithms indeed converge. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10479-008-0336-z | Annals OR |
Keywords | Field | DocType |
Location,Weber problem,Weiszfeld | Convergence (routing),Discrete mathematics,Mathematical optimization,Saddle point,Euclidean distance,Algorithm,Weber problem,Mathematics | Journal |
Volume | Issue | ISSN |
167 | 1 | 0254-5330 |
Citations | PageRank | References |
7 | 0.55 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zvi Drezner | 1 | 1195 | 140.69 |