Heuristic Approaches for K-Center Problem

被引：2

作者：

Rana, Rattan ^{[1
]}

Garg, Deepak ^{[1
]}

机构：

[1] Thapar Univ, Patiala, Punjab, India

来源：

2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3 | 2009年

关键词：

Heuristic; Facility location; k-center; greedy; optimizing; P-CENTER PROBLEM;

D O I：

10.1109/IADCC.2009.4809031

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The allocation of distribution centers or the facility center is an important issue for any company. The problem of facility location is faced by both new and existing companies and its solution is critical to a company's eventual success. This issue got the highest priority in last few years. It is equally important for both private as well as the public sector. The k-center problem is one of the basic problems in facility location. The aim is to locate a set of k facilities for a given set of demand points, such that for any demand point the nearest facility is as close as possible. Heuristics is a popular way to undertake such kind of typical problems. In this paper we present an intensive analysis of heuristic approach for k-center problem.

引用

页码：332 / 335

页数：4

共 14 条

[1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2] BUYUKBAARAN T, 2004, SOLVING P CTR PROBLE
[3] CHEN D, REVISING RELAXATION
[4] Daskin M. S., NETWORK DISCRETE LOC
[5] Drezner Z., 2004, Facility location: applications and theory
[6] CLUSTERING TO MINIMIZE THE MAXIMUM INTERCLUSTER DISTANCE
GONZALEZ, TF
[J]. THEORETICAL COMPUTER SCIENCE, 1985, 38 (2-3) : 293 - 306
[7] A BEST POSSIBLE HEURISTIC FOR THE K-CENTER PROBLEM
HOCHBAUM, DS
SHMOYS, DB
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) : 180 - 184
[8] MARTINICH JS, 1988, NAV RES LOG, V35, P185, DOI 10.1002/1520-6750(198804)35:2<185::AID-NAV3220350204>3.0.CO
[9] 2-R
[10] Mihelic J., 2005, Journal of Computing and Information Technology - CIT, V13, P225, DOI 10.2498/cit.2005.03.05

← 1 2 →