Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions

DOI10.1111/ITOR.12168MaRDI QIDQ2829166zbMATH OpenOpenAlexFDO

Authors Vinícius Leal do Forte, Flávio Marcelo Tavares Montenegro, José André de Moura Brito, Nelson Maculan

Publication date 27 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.12168

zbMATH Keywords

ILSmetaheuristicsEuclidean Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
• Local search for the Steiner tree problem in the Euclidean plane
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space

Cites work

• scientific article; zbMATH DE number 23663 (Why is no real title available?)
• scientific article; zbMATH DE number 3388861 (Why is no real title available?)
• A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An O(N²) heuristic for steiner minimal trees in E³
• An improved algorithm for computing Steiner minimal trees in Euclidean d-space
• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• How to find Steiner minimal trees in Euclidean \(d\)-space
• Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R^d
• Steiner Minimal Trees
• The Complexity of Computing Steiner Minimal Trees
• The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
• The Steiner tree problem
• Using a conic formulation for finding Steiner minimal trees

Cited in

(7)

• Numerical approximation of the Steiner problem in dimension $2$ and $3$
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
• A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
• Local optimization in the Steiner problem on the Euclidean plane
• 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

Describes a project that uses

Uses Software

• FindSteinerTree

This page was built for publication: Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829166)