HOME   |   SNU   |   mySNU   |   Library




   Number of Items : 52,642

Simple item record

Please use this identifier to cite or link to this item: http://hdl.handle.net/10371/1755

Hit : 152   Download : 279

Metadata Downloads :

Title  :

K-Median Problem on Graph

Authors  :

Ahn, Sanghyung

Publisher  :

College of Business Administration (경영대학)

Keywords  :

안상형

Issue Date  :

2000

Citation  :

Seoul Journal of Business Vol6(1): 113~122(2000)

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

URI  :

http://hdl.handle.net/10371/1755

Appears in Collections :

Seoul Journal of Business > College of Business Administration(경영대학) > College of Business Administration/Business School (경영대학/대학원) > Seoul Journal of Business Volume 06, Number 1/2 (2000)


Files in This Item: Description SizeFormat
SJBv6n1_113.pdf 354KbAdobe PDFView/Open
FusionCharts.

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