A note on genetic algorithms for degree-constrained spanning tree problems

Abstract

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. © 1997 John Wiley & Sons, Inc. Networks 30: 91–95, 1997