K-Median Location

Abstract

Let C = (c_ij) be an m by n matrix, and k be an integer l ≤ k < m. The k-median location problem is to find a subset S of k rows of C that maximizes

$$ \sum\limits_{{j = 1}}^{n} {\mathop{{\max }}\limits_{{i \in S}} {\mkern 1mu} {{c}_{{ij}}}} $$

. The heuristic procedure to be described finds a near-optimum solution in time proportional to mn.