SHERP

K-Median Problem on Graph

Cited 0 time in webofscience Cited 0 time in scopus
Authors
Ahn, Sanghyung
Issue Date
2000
Publisher
College of Business Administration (경영대학)
Citation
Seoul Journal of Business Vol6(1): 113~122(2000)
Keywords
안상형
Abstract
In past decades there has been a tremendous growth in the
literature on location problems. However, among the myriad of
formulations provided, the simple plant location problem and
the k-median problem have played a central role. This
phenomenon is due to the fact that both problems have a wide
range of real-world applications, and a mathematical
formulation of these problems as an integer program has proven
very fruitful in the derivation of solution methods.
In this paper we investigate the k-median problem defined on
a graph. That is, each point represents a vertex of a graph.
ISSN
1226-9816
Language
English
URI
http://hdl.handle.net/10371/1755
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Dept. of Business Administration (경영학과)Seoul Journal of BusinessSeoul Journal of Business Volume 06, Number 1/2 (2000)
  • mendeley

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

Browse