Competitive decision algorithm for the degree-constrained minimum spanning tree
Ma Liang · Journal of systems engineering · 2005
Finding the degree_constrained minimum spanning tree(DCMST) of a graph is a NP_hard problem which is important in the network design and optimization.A competitive decision algorithm is introduced,which is a new optimization idea based on the characteristics that competition builds optimisation and the result of competition hinges on decision.According to the general model of competitive decision algorithm,a competitive decision algorithm for DCMST is proposed.Series of numerical examples of DCMST are tested and the computational performances of the algorithm are compared those of some other algorithms in the literatures.