Algorithms for degree-constrained Euclidean Steiner minimal tree

查看全文 作　　者：Zhang [1,2]Jin;Ma [1]Liang;Zhang [2]Liantang

机构地区：[1]School of Management, Univ. of Shanghai for Science and Technology, Shanghai 200093, P. R. China;[2]Computer and Information Engineering Coll., Univ. of Henan, Kaifeng 475001, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》索引2008年第19卷第4期,共7页

基　　金：the National Natural Science Foundation of China (70471065);the Shanghai Leading Academic Discipline Project (T0502). 摘　　要：A new problem of degree-constrained Euclidean Steiner minimal tree is discussed,which is quite useful in several fields.Although it is slightly different from the traditional degree-constrained minimal spanning tree,it is also NP-hard.Two intelligent algorithms are proposed in an attempt to solve this difficult problem.Series of numerical examples are tested,which demonstrate that the algorithms also work well in practice. 关键词：模拟退火欧几里得几何学极小树蚂蚁运算法则

相关文献

参考文献（16）
引证文献（1）
耦合文献（0）

参考文献(16)

引证文献(1)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Algorithms for degree-constrained Euclidean Steiner minimal tree

参考文献(16)

引证文献(1)

用户提示