Publications
Detailed Information
Computational comparison of two Lagrangian relaxation for the K-median problem
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Issue Date
- 1989-09
- Publisher
- 서울대학교 경영대학 경영연구소
- Citation
- 경영논집, Vol.23 No.3, pp. 32-40
- Keywords
- 32-40
- Description
- 1989-09
- 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.
- ISSN
- 1229-0491
- Language
- English
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.