Using a conic formulation for finding Steiner minimal trees
From MaRDI portal
Publication:596675
DOI10.1023/B:NUMA.0000021765.17831.bczbMath1047.90055MaRDI QIDQ596675
Márcia H. C. Fampa, Nelson F. Maculan
Publication date: 10 August 2004
Published in: Numerical Algorithms (Search for Journal in Brave)
Related Items (9)
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ Geometry-experiment algorithm for Steiner minimal tree problem ⋮ A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization ⋮ 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\) ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension ⋮ Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions
This page was built for publication: Using a conic formulation for finding Steiner minimal trees
