The hybrid spanning tree problem

研究成果: 雜誌貢獻期刊論文同行評審

1 引文 斯高帕斯(Scopus)

摘要

The minimal spanning tree problem is a well-known problem in operations research. In this paper, a new variant of the minimal spanning tree problem, termed the hybrid spanning tree problem, is proposed. This problem assumes that each edge in the network has two attributes, where the first is the cost and the second is the degree of difficulty. The bottleneck of a tree is the maximum degree of difficulty of all edges in the tree. The hybrid spanning tree problem is to find a spanning tree in the network such that the weighted objective function of α × (the total cost of the tree) + β × (the bottleneck of the tree) is minimized. In this paper, two efficient algorithms are proposed. When the values of α and β are given nonnegative constants, the first algorithm can find the minimal weight spanning tree in time of O(mn), where m and n are the numbers of edges and nodes in the network, respectively. When the values of α and β are nonnegative variables, the second algorithm can find all possible minimal weight spanning trees also in time O(mn).

原文???core.languages.en_GB???
頁(從 - 到)179-188
頁數10
期刊European Journal of Operational Research
77
發行號1
DOIs
出版狀態已出版 - 25 8月 1994

指紋

深入研究「The hybrid spanning tree problem」主題。共同形成了獨特的指紋。

引用此