Computational comparison of two Lagrangian relaxation for the K-median problem

Abstract

The k-median problem has been widely studied both from the theoretical point of view and for its application. An interesting theoretical development

.was the successful probabilistic analysis of several heuristics (e.g. Fisher and Hochbaum (6) and Papadimitriou (11)) and relaxation (e.g, Ahn et at (2)) and polyhedral study (Ahn 0) and Guignard(8)) for this problem. On the other hand, the literature on the k-median problem abounds in exact algorithms. Most (e.g. Cornuejols et al (3)) are based on the solution of relaxtion.