A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
From MaRDI portal
Publication:6080617
DOI10.1111/itor.13265OpenAlexW4319164880MaRDI QIDQ6080617
Hacene Ouzia, Renan Vicente Pinto, Nelson F. Maculan
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13265
integer programmingSteiner treeEuclidean Steiner tree problemmixed integer nonlinear optimizationsecond-order conic optimizationnonlinear optimization models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Using a conic formulation for finding Steiner minimal trees
- 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\)
- 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\)
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
- On the history of the Euclidean Steiner tree problem
- An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
- Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions
- Steiner Trees and 3-D Macromolecular Conformation
- Steiner Trees for Terminals Constrained to Curves
- Constant Time Generation of Rooted Trees
- The Complexity of Computing Steiner Minimal Trees
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- Constant Time Generation of Free Trees
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Steiner Minimal Trees
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
