Minisum location problem with farthest Euclidean distances

  title={Minisum location problem with farthest Euclidean distances},
  author={Jian-lin Jiang and Ya Xu},
  journal={Math. Meth. of OR},
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
3 Citations
19 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 19 references

An algorithm for a constrained Weber problem

  • P Hansen, D Peeters, J-F Thisse
  • Manag
  • 1982
Highly Influential
8 Excerpts

An approach to location models involving sets as existing facilities

  • F Plastria
  • Math Oper Res
  • 2003

Rodriguez-Chia A (2003) An approach to location models involving sets as existing facilities

  • S Nickel, J Puerto
  • Math Oper Res
  • 2003

Wesolowsky GO (2002a) Minisum location with closest Euclidean distances

  • 2002

Wesolowsky GO (2002b) Locating facilities by minimax relative to closest points

  • J Brimberg
  • Oper Res
  • 2002

Note : facility location with closest rectangular distances

  • J Brimberg, GO Wesolowsky
  • Naval Res Logist
  • 2000
1 Excerpt

The Weber Problem with regional demand

  • E Carrizosa, M Munoz, J Puerto
  • Eur J Oper
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…