Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
A generalized Weiszfeld method for the multi-facility location problem
Date
2010-05-01
Author
İyigün, Cem
Ben-Israel, Adi
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
6
views
0
downloads
Cite This
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.
Subject Keywords
Fermat-Weber location problem
,
Multi-facility location problem
,
Decomposition method
,
Probabilistic assignments
,
Weiszfeld method
URI
https://hdl.handle.net/11511/43210
Journal
OPERATIONS RESEARCH LETTERS
DOI
https://doi.org/10.1016/j.orl.2009.11.005
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. İyigün and A. Ben-Israel, “A generalized Weiszfeld method for the multi-facility location problem,”
OPERATIONS RESEARCH LETTERS
, vol. 38, no. 3, pp. 207–214, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43210.