| Article ID: | iaor20021955 |
| Country: | United States |
| Volume: | 30 |
| Issue: | 2 |
| Start Page Number: | 91 |
| End Page Number: | 95 |
| Publication Date: | Sep 1997 |
| Journal: | Networks |
| Authors: | Gen Mitsuo, Zhou Gengui |
| Keywords: | minimum spanning trees, genetic algorithms |
The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to demonstrate the effectiveness of the proposed approach.