OPERATIONS RESEARCH LETTERS, cilt.38, sa.3, ss.207-214, 2010 (SCI-Expanded)
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. (C) 2009 Elsevier B.V. All rights reserved.