Affordable Access

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

Authors
Publisher
서울대학교 경영대학 경영연구소
Publication Date
Disciplines
  • Computer Science

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.

There are no comments yet on this publication. Be the first to share your thoughts.