Browse

Computational Comparison of Two Lagrangian Relaxation for the K-median Problem

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
Ahn, Sang-Hyung
Issue Date
1997
Publisher
서울대학교 경영정보연구소
Citation
Journal of information and operations management, Vol.07, pp. 73-86
Abstract
The k-median problem has been widely studies 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[7], Papadimitriou[12]), relaxations (e.g. Ahn et al [2]), and polyhedral study(Ahn[2], Guignard[9]) for this problem. On the other hand, the literature on the k-median problem abounds in exact algorithms. Most(e.g. Cornuejols et al[4]) are based on the solution of relaxation. The computational experience reported in the literature seems to indicate that this relaxation yields impressively tight bounds compared to what can usually be expected in integer programming. In this paper we perform extensive computational analysis of two Largarangian relaxation for the k-median problem...
Language
English
URI
http://hdl.handle.net/10371/53117
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Institute of Information and Operation Management (경영정보연구소)Journal of information and operations management (경영정보논총)Journal of information and operations management vol.07 (1997) (경영정보논총)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse