For solving the problem of finding the degree-constrained minimum spanning tree(DCMST) in network design and optimization,a heuristic search method is proposed,in which based on minimum spanning tree,degrees of vertices over the constrained degrees are reduced to the required state.Series of numerical examples are tested and the results are compared with that of some other algorithms.Computational results show the effectiveness and generality of the method.