Title :
A location problem on network
Author :
Zhang, Youlin ; Zhu, Junhui
Author_Institution :
Zhengzhou Inst. of Aeronaut. Ind. Manage., Zhengzhou, China
Abstract :
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 (n2), then some approximate methods based on tree´s situation are designed.
Keywords :
computational complexity; network theory (graphs); trees (mathematics); NP-complete problem; network location problem; polynomial-time algorithm; total weighted distance; tree; Algorithm design and analysis; Approximation algorithms; Complexity theory; Computer applications; Modeling; Optimization; Skeleton; algorithms and complexity; network location problems; point-path distance; polynomial algorithm;
Conference_Titel :
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-7235-2
Electronic_ISBN :
978-1-4244-7237-6
DOI :
10.1109/ICCASM.2010.5622695
