Two heuristics for the Euclidean Steiner tree problem
From MaRDI portal
Publication:1265187
DOI10.1023/A:1008285504599zbMath0909.90199MaRDI QIDQ1265187
Derek R. Dreyer, Michael L. Overton
Publication date: 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items (4)
Applications of second-order cone programming ⋮ A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
This page was built for publication: Two heuristics for the Euclidean Steiner tree problem
