Pages that link to "Item:Q1186793"

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

Displaying 23 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)
• Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
• Minimal curvature-constrained networks (Q1756754) (← links)
• Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
• Gradient-constrained minimum networks. III: Fixed topology (Q1934615) (← links)
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
• Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) (Q2131142) (← links)
• Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
• Approximate Euclidean Steiner trees (Q2397467) (← links)
• Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← links)
• Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920) (← links)
• An overview of exact algorithms for the Euclidean Steiner tree problem in<i>n</i>-space (Q2827758) (← links)
• Iterated local search algorithms for the Euclidean Steiner tree problem in<i>n</i>dimensions (Q2829166) (← 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)