A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)

DOI10.1007/s11750-022-00642-4zbMath1527.90242OpenAlexW4294723941WikidataQ114221877 ScholiaQ114221877MaRDI QIDQ6113557

Renan Vicente Pinto, Nelson F. Maculan

Publication date: 11 July 2023

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-022-00642-4

zbMATH Keywords

combinatorial optimizationheuristicsecond-order cone programmingEuclidean Steiner tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
• Algebraic optimization: The Fermat-Weber location problem
• Using a conic formulation for finding Steiner minimal trees
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
• On Steiner ratio conjectures
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• How to find Steiner minimal trees in Euclidean \(d\)-space
• A heuristic for Euclidean and rectilinear Steiner problems
• Two heuristics for the Euclidean Steiner tree problem
• On the Steiner ratio in 3-space
• The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
• Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
• On the history of the Euclidean Steiner tree problem
• The Steiner ratio Gilbert-Pollak conjecture is still open
• An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
• Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions
• Steiner Trees and 3-D Macromolecular Conformation
• On the Problem of Steiner
• The Steiner ratio conjecture of Gilbert and Pollak is true.
• The Complexity of Computing Steiner Minimal Trees
• 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
• 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