Pages that link to "Item:Q596675"
From MaRDI portal
The following pages link to Using a conic formulation for finding Steiner minimal trees (Q596675):
Displaying 9 items.
- 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)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← 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 Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← 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)
