Algorithms for degree-constrained Euclidean Steiner minimal tree |
| |
| Authors: | Zhang Jin [Author Vitae] Ma Liang [Author Vitae] [Author Vitae] |
| |
| Affiliation: | a School of Management, Univ. of Shanghai for Science and Technology, Shanghai 200093, P. R. China
b Computer and Information Engineering Coll., Univ. of Henan, Kaifeng 475001, P. R. China |
| |
| Abstract: | 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. |
| |
| Keywords: | degree-constrained Euclidean Steiner minimal tree simulated annealing ant algorithm |
| 本文献已被 维普 ScienceDirect 等数据库收录！ |
