Answers are grounded in this paper and cite their sources.
This paper considers the multidimensional weighted minimax location problem, namely, finding a facility location that minimizes the maximal weighted distance to n points. General distance norms are used. An epsilon-approximate solution is obtained by applying a variant of the Russian method for the solution of Linear Programming. The algorithm has a time complexity of O(n log epsilon) for fixed dimensionality k. Computational results are presented.
No takes yet. Share an insight, caveat, or question.
Drezner et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: