A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm
1996
The degree-constrained minimum spanning tree problem is of high practical importance. Up to now there have been few effective algorithms to solve this problem because of its NP-hard complexity. In this paper we present an approach to solving this problem by using genetic algorithms (GAs), and provide numerical example to demonstrate the efficiency of the proposed approach.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
59
Citations
NaN
KQI