Solving the Degree-Constrained Euclidean Steiner Minimal Tree Problem
The degree-constrained Euclidean Steiner minimal tree problem was discussed based on the Euclidean Steiner minimal tree with each original point being added with a degree constraint. The property of the problem was analyzed and the implementation process of solving the problem by using the simulated annealing algorithm and the ant algorithm was presented. Both algorithms are coded in Delphi and run on the Windows XP environment. Series of numerical examples were tested and the efficiency of these algorithms was validated.
Helen Zhang, Gang Shen and David Jin
S. J. Dong "Solving the Degree-Constrained Euclidean Steiner Minimal Tree Problem", Advanced Materials Research, Vols. 219-220, pp. 652-655, 2011