A generalized Weiszfeld method for the multi-facility location problem

Cem Iyigun, Adi Ben-Israel

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


An iterative method is proposed for the K facilities location problem. The problem is relaxed using probabilistic assignments, depending on the distances to the facilities. The probabilities, that decompose the problem into K single-facility location problems, are updated at each iteration together with the facility locations. The proposed method is a natural generalization of the Weiszfeld method to several facilities.

Original languageEnglish (US)
Pages (from-to)207-214
Number of pages8
JournalOperations Research Letters
Issue number3
StatePublished - May 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Applied Mathematics
  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research


  • Decomposition method
  • Fermat-Weber location problem
  • Multi-facility location problem
  • Probabilistic assignments
  • Weiszfeld method


Dive into the research topics of 'A generalized Weiszfeld method for the multi-facility location problem'. Together they form a unique fingerprint.

Cite this