The Fermat-Weber location problem revisited

  title={The Fermat-Weber location problem revisited},
  author={Jack Brimberg},
  journal={Math. Program.},
The Fermat-Weber location problem requires finding a point in ~ N that minimizes the sum of weighted Euclidean distances to m given points. A one-point iterative method was first introduced by Weiszfeld in 1937 to solve this problem. Since then several research articles have been published on the method and generalizations thereof. Global convergence of Weiszfeld's algorithm was proven in a seminal paper by Kuhn in 1973. However, since the m given points are singular points of the iteration… CONTINUE READING
Highly Cited
This paper has 78 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.

79 Citations

Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 10 references

A note on Fermat's problem

  • H. W. Kuhn
  • Mathematical Programming 4 () 98-107.
  • 1973
3 Excerpts

Location-allocation problems

  • L. Cooper
  • Operations Research 11 () 37-52.
  • 1963
1 Excerpt

An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics

  • H. W. Kuhn, R. E. Kuenne
  • Journal of Regional Science 4 () 21-34.
  • 1962
1 Excerpt

Link-length minimization in networks

  • W. Miehle
  • Operations Research 6 () 232-243.
  • 1958
1 Excerpt

Sur le point par lequel la somme des distances de n points donn6s est minimum

  • E. Weiszfeld
  • Tohoku Mathematics Journal 43 () 355-386.
  • 1937
1 Excerpt