An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
From MaRDI portal
Publication:2827758
DOI10.1111/itor.12207zbMath1348.90593OpenAlexW1957367111MaRDI QIDQ2827758
Jon Lee, Márcia H. C. Fampa, Nelson F. Maculan
Publication date: 21 October 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12207
global optimizationexact algorithm\(n\)-dimensional Euclidean spacemixed-integer nonlinear programmingEuclidean Steiner tree problem
Related Items (7)
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs ⋮ Virtuous smoothing for global optimization ⋮ 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\) ⋮ Reorganizing topologies of Steiner trees to accelerate their eliminations ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Uses Software
Cites Work
- Unnamed Item
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Using a conic formulation for finding Steiner minimal trees
- SCIP: solving constraint integer programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
- How to find Steiner minimal trees in Euclidean \(d\)-space
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
- On the history of the Euclidean Steiner tree problem
- Steiner Trees for Terminals Constrained to Curves
- On the Problem of Steiner
- Branching and bounds tighteningtechniques for non-convex MINLP
- The Complexity of Computing Steiner Minimal Trees
- Euclidean Steiner minimum trees: An improved exact algorithm
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Steiner Minimal Trees
This page was built for publication: An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
