Pages that link to "Item:Q951125"

The following pages link to An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125):

Displaying 10 items.

• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← 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)
• Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← 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)
• Reorganizing topologies of Steiner trees to accelerate their eliminations (Q5216441) (← 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)