Name
Abstract | ||
|---|---|---|
The Weber problem consists of finding a point in Rn that minimizes the weighted sum of distances from m points in Rn that are not collinear. An application that motivated this problem is the optimal location of facilities in the 2-dimensional case. A classical method to solve the Weber problem, proposed by Weiszfeld in 1937, is based on a fixed-point iteration. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.amc.2011.08.041 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Weber problem,Box constraints,Fixed-point iteration,Location problems,Weiszfeld algorithm | Mathematical optimization,Mathematical analysis,Fixed-point iteration,Karush–Kuhn–Tucker conditions,Weber problem,Mathematics | Journal |
Volume | Issue | ISSN |
218 | 6 | 0096-3003 |
Citations | PageRank | References |
4 | 0.56 | 23 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elvio A. Pilotta | 1 | 53 | 4.26 |
| Germán Ariel Torres | 2 | 8 | 1.43 |