degree constrained;
minimum spanning tree;
ant algorithm;
D O I:
暂无
中图分类号:
O22 [运筹学];
学科分类号:
070105 ;
1201 ;
摘要:
Based on the ant system methodology,this paper offers an algorithm for the degree constrained minimum spanning tree problem.Compared with some other algorithms, numerical examples are tested which give promising results and useful conclusions.