p-CenterProblem的一个基于中心图合并操作的启发式算法

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名

邮箱

手机号码

标题

留言内容

验证码

A Heuristic Algorithm for p-Center Problem Based on Combining Operations on Center Graphs

School of Traffic & amp; Transportation, Southwest Jiaotong University, Chengdu 610031, China

摘要: 设计的启发式算法从图的合并操作出发, 降低了计算复杂度, 从应用效果看接近最优的程度也较以往算法好
- 中心图 /
- 合并操作 /
- 拆分合并操作 /
- p-Center问题
Abstract: The heuristic algorithm given in this paper, which is based on Combining Operations on Center Graph (COCG), lowers the complexity of calculation, and its result is more closer to the optimization than available algorithms from the appliance.
- center graph /
- combining operation /
- breaking combining operation /
- p-Center Problem

[1]	HARKIMI S L. Optimal locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research, 1964, 12(3): 450-459.
[2]	KARIV O, HARKIMIM S L. An algorithimic approach to network location problems. Ⅰ: the p-Centers. SIAM J[J]. Applied Mathematics, 1979, 37(4): 513-538.