Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
From MaRDI portal
Publication:2131142
DOI10.1007/s10898-021-01001-6zbMath1491.90175OpenAlexW3009960892MaRDI QIDQ2131142
Hacene Ouzia, Nelson F. Maculan
Publication date: 25 April 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01001-6
integer programmingrelaxationSteiner treeEuclidean Steiner tree problemmixed integer nonlinear optimizationnonlinear optimization models
Related Items (3)
Capacitated clustering problems applied to the layout of IT-teams in software factories ⋮ 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\)
Uses Software
Cites Work
- 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
- 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
- Steiner Trees and 3-D Macromolecular Conformation
- The Complexity of Computing Steiner Minimal Trees
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Steiner Minimal Trees
This page was built for publication: Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)