A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
From MaRDI portal
Publication:316167
DOI10.1007/s10589-016-9835-zzbMath1353.90165OpenAlexW2284604408MaRDI QIDQ316167
Wendel Melo, Jon Lee, Márcia H. C. Fampa
Publication date: 26 September 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9835-z
branch-and-boundmixed integer nonlinear programmingEuclidean Steiner tree problemisomorphism pruning
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (5)
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ 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\) ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Orbital branching
- An algorithmic framework for convex mixed integer nonlinear programs
- How to find Steiner minimal trees in Euclidean \(d\)-space
- The Steiner tree problem
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
- Branching and bounds tighteningtechniques for non-convex MINLP
- The Complexity of Computing Steiner Minimal Trees
- Euclidean Steiner minimum trees: An improved exact algorithm
This page was built for publication: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
