A delaunay triangulation‐based heuristic for the euclidean steiner problem

DOI10.1002/net.3230240404zbMath0807.90115OpenAlexW2025638429MaRDI QIDQ4303626

F. Goffinet, John E. Beasley

Publication date: 8 March 1995

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240404

zbMATH Keywords

simulated annealingheuristicDelaunay triangulationminimal spanning treeEuclidean Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Metaheuristics: A bibliography ⋮ Gaussian mixture modeling and learning of neighboring characters for multilingual text extraction in images ⋮ 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 }\)

Uses Software

• OR-Library

Cites Work

• On the Problem of Steiner
• Unnamed Item

This page was built for publication: A delaunay triangulation‐based heuristic for the euclidean steiner problem