Pages that link to "Item:Q2829166"

The following pages link to Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (Q2829166):

Displaying 8 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)
• Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
• Local optimization in the Steiner problem on the Euclidean plane (Q2487670) (← links)
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
• Numerical approximation of the Steiner problem in dimension $2$ and $3$ (Q5235091) (← 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)