A generalized Weiszfeld method for the multi-facility location problem

Authors:
Cem Iyigun;Adi Ben-Israel
Affiliations:
Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey;RUTCOR-Rutgers Center for Operations Research, Rutgers University, NJ, USA
Venue:
Operations Research Letters
Year:
2010

Citing 7
Cited 1

A note on the Weber location problem

Annals of Operations Research - Special issue on locational decisions
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
A heuristic method for large-scale multi-facility location problems

Computers and Operations Research
A Unified Continuous Optimization Framework for Center-Based Clustering Methods

The Journal of Machine Learning Research
Probabilistic D-Clustering

Journal of Classification
Probabilistic distance clustering adjusted for cluster size

Probability in the Engineering and Informational Sciences
Iterative Minimization Schemes for Solving the Single Source Localization Problem

SIAM Journal on Optimization

A modification of the DIRECT method for Lipschitz global optimization for a symmetric function

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.