Computer Engineering and Applications ›› 2016, Vol. 52 ›› Issue (3): 27-31.

Previous Articles     Next Articles

Polynomial time exact algorithms for star 2-hub location problems

WANG Guangming1, CHEN Guangting2   

  1. 1.School of Science, Hangzhou Dianzi University, Hangzhou 310018, China
    2.Taizhou University, Linhai, Zhejiang 317000, China
  • Online:2016-02-01 Published:2016-02-03

星形2-hub选址问题的多项式时间算法

王广明1,陈光亭2   

  1. 1.杭州电子科技大学 理学院, 杭州 310018
    2.台州学院, 浙江 临海 317000

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.

null

Key words: 2-hub location, minimum cost, minimum delay

摘要: Hub作为特殊的设备在交通运输、邮政和电信网络中承担着交换、转载和整理的重要角色。研究一般网络中最小费用星形2-hub选址问题和最小时延星形2-hub选址问题,分别给出多项式时间算法,计算出2个hub的最佳位置。

关键词: 2-hub选址, 最小费用, 最小时延