Pages that link to "Item:Q1186793"

The following pages link to How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793):

Displaying 10 items.

• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
• On the Steiner ratio in 3-space (Q1345879) (← links)
• The Steiner tree problem in orientation metrics (Q1384537) (← links)
• A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) (← links)
• Network modelling of underground mine layout: two case studies (Q5438555) (← links)
• A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ (Q6080617) (← links)
• A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557) (← links)