Answers are grounded in this paper and cite their sources.
We discuss the problem of locating a new facility among n given demand points on a plane. The maximum weighted distance to demand points must be minimized. The general lₚ-norm ( p 1) is used as distance measure. The method is quite fast computationally: for example, a 3000 demand point problem in lₚ is solved in half a second.
No takes yet. Share an insight, caveat, or question.
Drezner et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: