首页|Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
? 2019 Elsevier B.V.We present well known properties related to the topology of Steiner minimal trees and to the geometric position of Steiner points, and investigate their application in the exact algorithms that have been proposed for the Euclidean Steiner problem. We discuss the difficulty in the application of properties that were very successfully applied to solve the problem in the plane, when the dimension of the space increases, and point out that the application of some geometric conditions for Steiner points is hindered when the well known implicit enumeration scheme proposed by Smith in 1992 is considered. Finally, we mention mathematical-optimization methods as a direction to explore in the search for good formulations of inequalities that would allow the application of these restrictive geometric conditions.
Euclidean Steiner problemMINLPSteiner minimal tree
NSTL
Elsevier
