scientific article; zbMATH DE number 4016557
From MaRDI portal
Recommendations
- A heuristic for Euclidean and rectilinear Steiner problems
- A delaunay triangulation‐based heuristic for the euclidean steiner problem
- Two heuristics for the Euclidean Steiner tree problem
- New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
- An algorithm for the steiner problem in the euclidean plane
Cited in
(7)- 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 }\)
- A heuristic for Euclidean and rectilinear Steiner problems
- A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
- Local search for the Steiner tree problem in the Euclidean plane
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Local optimization in the Steiner problem on the Euclidean plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028682)