An improved algorithm for computing Steiner minimal trees in Euclidean d-space
From MaRDI portal
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
Recommendations
- An Improved Algorithm for Steiner Trees
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
- Euclidean Steiner minimum trees: An improved exact algorithm
- An algorithm for the steiner problem in the euclidean plane
- How to find Steiner minimal trees in Euclidean \(d\)-space
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- A linear time algorithm for full Steiner trees
- An algorithm for the steiner problem in the euclidean plane
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- Applications of second-order cone programming
- Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
- Euclidean Steiner minimum trees: An improved exact algorithm
- Exact computation of Steiner minimal trees in the plane
- Hexagonal coordinate systems and Steiner minimal trees
- How to find Steiner minimal trees in Euclidean \(d\)-space
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 1424547 (Why is no real title available?)
- Improved computation of plane Steiner minimal trees
- On the Problem of Steiner
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Steiner Minimal Trees
- The Complexity of Computing Steiner Minimal Trees
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- The Steiner tree problem
- Using a conic formulation for finding Steiner minimal trees
Cited in
(17)- Improved computation of plane Steiner minimal trees
- Geometric conditions for Euclidean Steiner trees in R^d
- 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\)
- Computing Euclidean Steiner trees over segments
- Degree bounded bottleneck spanning trees in three dimensions
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
- Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
- An Improved Algorithm for Steiner Trees
- Reorganizing topologies of Steiner trees to accelerate their eliminations
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- On better heuristics for Steiner minimum trees
- Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
This page was built for publication: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951125)
