A greedy-type heuristic is presented for the p-median problem and computational results for problems having up to 400 vertices are shown. The paper describes a dual heuristic procedure for the p-median based on Erlenkotter’s heuristic for the uncapacitated facility location problem. A primal-dual heuristic that generates a primal solution based on a good dual solution is also presented. For both procedures, computational experience relative to the same set of large size test problems is reported. Finally, the results obtained from all procedures are compared with the bounds, and corresponding computing times, provided by other available heuristics for the p-median location problem.
