In this paper we investigate the conditional p-median problem. Optimal
algorithms for the Euclidean case in the plane for the 1-median with
several existing facilities are proposed. A general heuristic algorith
m for any metric or environment (network or continuous space) is prese
nted. The algorithm is based on solving several p-median problems.