Pages that link to "Item:Q1593533"

The following pages link to The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533):

Displaying 13 items.

• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
• Using a conic formulation for finding Steiner minimal trees (Q596675) (← links)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← 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)
• On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs (Q2174883) (← links)
• Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\) (Q2776573) (← links)
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
• Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (Q2829166) (← links)
• A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← 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)