The Planar Two-Center and Two-Median Problems

Abstract

We present algorithms for the solution of planar location-allocation problems with two new facilities. Euclidean distances are assumed. We address both the minimax (or “two-center”), and minisum (or “two-median”) problems. Computational results are presented.