A Location Problem On Network

摘要：

In this article we considered a kind of new location problem, The problem is to determine a path on the network to minimize the total weighted distance from it to n given point on the network. It is proved that the problem is NP-complete.When the network is a tree,The problem is solved by polynomial-time algorithm, this algorithm complexity is O (n~2 ), then some approximate methods based on trees situation are designed.

关键词： network location problems point-path distance algorithms and complexity polynomial algorithm

作者: Youlin Zhang Junhui Zhu

作者单位: Zhengzhou Institute Of Aeronautical Industry Management .Zhengzhou Henan,450015,China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 147-149

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）