Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions

DOI10.1111/itor.12168zbMath1348.90601OpenAlexW1937025243MaRDI QIDQ2829166

Flávio Marcelo Tavares Montenegro, Vinícius Leal do Forte, José André de Moura Brito, Nelson F. 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)

Related Items (3)

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\) ⋮ Numerical approximation of the Steiner problem in dimension $2$ and $3$

Uses Software

• FindSteinerTree

Cites Work

• Unnamed Item
• Unnamed Item
• 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 Steiner tree problem
• The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
• The Complexity of Computing Steiner Minimal Trees
• Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R^d
• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
• An O(N²) heuristic for steiner minimal trees in E³
• Steiner Minimal Trees

This page was built for publication: Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions