Minisum location problem with farthest Euclidean distances

@article{Jiang2006MinisumLP,
title={Minisum location problem with farthest Euclidean distances},
author={Jian-lin Jiang and Ya Xu},
journal={Math. Meth. of OR},
year={2006},
volume={64},
pages={285-308}
}

The paper formulates an extended model of Weber problem in which the customers are represented by convex demand regions. The objective is to generate a site in R2 that minimizes the sum of weighted Euclidean distances between the new facility and the farthest points of demand regions. This location problem is decomposed into a polynomial number of subproblems: constrained Weber problems (CWPs). A projection contraction method is suggested to solve these CWPs. An algorithm and the complexity… CONTINUE READING