Using a conic formulation for finding Steiner minimal trees
From MaRDI portal
Recommendations
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- Convex relaxation and variational approximation of the Steiner problem: theory and numerics
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- scientific article; zbMATH DE number 1339503
- Convexity and the Steiner tree problem
Cited in
(12)- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- Geometry-experiment algorithm for Steiner minimal tree problem
- Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
This page was built for publication: Using a conic formulation for finding Steiner minimal trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596675)
