search query: @indexterm GRAPHS / total: 86
reference: 24 / 86
| Author: | Chen, Y. |
| Title: | The hybrid spanning tree problem |
| Journal: | European Journal of Operational Research
1994 : AUG 25, VOL. 77:1, p. 179-188 |
| Index terms: | NETWORKS GRAPHS MANAGEMENT |
| Language: | eng |
| Abstract: | 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 is presented. 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 a plus b is minimized. |
SCIMA