Pages that link to "Item:Q316167"
From MaRDI portal
The following pages link to A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167):
Displaying 10 items.
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← 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)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← 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 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)
