Local search for the Steiner tree problem in the Euclidean plane

DOI10.1016/S0377-2217(99)00131-9zbMATH Open0933.90065OpenAlexW2088172021MaRDI QIDQ1806730FDOQ1806730

Martin Zachariasen

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00131-9

Recommendations

• Two heuristics for the Euclidean Steiner tree problem
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
• scientific article; zbMATH DE number 1323037
• Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem

zbMATH Keywords

heuristicslocal searchSteiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• A data structure for dynamic trees
• Title not available (Why is that?)
• Improved Approximations for the Steiner Tree Problem
• Title not available (Why is that?)
• The Steiner tree problem
• Steiner Minimal Trees
• On the Problem of Steiner
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• How to find Steiner minimal trees in Euclidean \(d\)-space
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Euclidean Steiner minimum trees: An improved exact algorithm
• The shortest network under a given topology
• Title not available (Why is that?)
• Steiner Trees for Ladders
• On better heuristics for Steiner minimum trees
• A linear time algorithm for full Steiner trees
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• Two heuristics for the Euclidean Steiner tree problem
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• A delaunay triangulation‐based heuristic for the euclidean steiner problem
• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• An O(N²) heuristic for steiner minimal trees in E³
• Title not available (Why is that?)
• Steiner's problem in graphs: Heuristic methods
• Steiner minimal trees for three points with one convex polygonal obstacle
• The Generation of Minimal Trees with a Steiner Topology
• A heuristic for Euclidean and rectilinear Steiner problems
• Title not available (Why is that?)
• A neural network for the Steiner minimal tree problem
• A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem

Cited In (9)

• Parallel local search for Steiner trees in graphs
• Maximising the worth of nascent networks
• Heuristics for automated knowledge source integration and service composition
• Short trees in polygons
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Local optimization in the Steiner problem on the Euclidean plane
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs

Uses Software

• LEDA
• OR-Library
• FindSteinerTree

This page was built for publication: Local search for the Steiner tree problem in the Euclidean plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806730)