Single Facility $l_p $-Distance Minimax Location

Abstract

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_p $-norm $( p\geqq 1)$ is used as distance measure. The method is quite fast computationally: for example, a 3000 demand point problem in $l_p $ is solved in half a second.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 65 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.