The Euclidean Steiner tree problem in R^n: A mathematical programming formulation
DOI10.1023/A:1018903619285zbMATH Open0966.90064OpenAlexW32401548MaRDI QIDQ1593533FDOQ1593533
Authors: Nelson Maculan, Philippe Michelon, Adilson Elias Xavier 
Publication date: 17 January 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018903619285
Recommendations
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Using a conic formulation for finding Steiner minimal trees
Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27) Mixed integer programming (90C11) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30)
Cited In (13)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
- 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\)
- New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Using a conic formulation for finding Steiner minimal trees
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
This page was built for publication: The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593533)
