计算机工程与应用 ›› 2016, Vol. 52 ›› Issue (3): 27-31.
• 理论与研发 • 上一篇 下一篇
王广明1，陈光亭2
出版日期:
发布日期:
WANG Guangming1, CHEN Guangting2
Online:
Published:
摘要： Hub作为特殊的设备在交通运输、邮政和电信网络中承担着交换、转载和整理的重要角色。研究一般网络中最小费用星形2-hub选址问题和最小时延星形2-hub选址问题，分别给出多项式时间算法，计算出2个hub的最佳位置。
关键词: 2-hub选址, 最小费用, 最小时延
Abstract: Hubs are special facilities that play an important role as switching, transshipment and sorting points in transportation, postal and telecommunication networks. This paper studies the minimum cost star 2-hub location problem and minimum delay star 2-hub location problem, and designs a polynomial time exact algorithm for these problems to compute the optimal two hub locations, respectively.
Key words: 2-hub location, minimum cost, minimum delay
王广明1，陈光亭2. 星形2-hub选址问题的多项式时间算法[J]. 计算机工程与应用, 2016, 52(3): 27-31.
WANG Guangming1, CHEN Guangting2. Polynomial time exact algorithms for star 2-hub location problems[J]. Computer Engineering and Applications, 2016, 52(3): 27-31.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2016/V52/I3/27
