Minimax location with farthest Euclidean distances

Jianlin Jiang, Xiaoming Yuan*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

Abstract

This paper considers the locations of facilities in the plane, with the aim of minimizing the maximal weighted distance between facilities and regional customers where the distances between facilities and regional customers are evaluated by the farthest Euclidean distances. We consider both the single-facility case and the multiple-facilities case, and we propose some efficient algorithms. We report some numerical results to verify the efficiency of these algorithms.

Original languageEnglish
Pages (from-to)407-428
Number of pages22
JournalPacific Journal of Optimization
Volume8
Issue number3
Publication statusPublished - Jul 2012

Scopus Subject Areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Facility location
  • Farthest Euclidean distance
  • Location-allocation heuristic
  • Minimax objective
  • Regional demand

Fingerprint

Dive into the research topics of 'Minimax location with farthest Euclidean distances'. Together they form a unique fingerprint.

Cite this