Heuristic methods for the p-center problem

This paper deals with heuristic methods for the p-center problem in any metric space. Due to the complexity of this problem, a variety of heuristic algorithms have been proposed in different cases, usually in Network and Planar Location. Most of them are related to some class of method that can be used for the problem in any metric space. A review of these methods is presented and a new method is also proposed which is a 2-approximation heuristic for some particular cases of the problem.