Parallel local search for Steiner trees in graphs

DOI10.1023/A:1018908614375zbMath0937.90113OpenAlexW198341110MaRDI QIDQ1808193

M. G. A. Verhoeven, M. E. M. Severens

Publication date: 2 December 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018908614375

zbMATH Keywords

Steiner tree problemtraveling salesman problemmultiple-step parallelismparallel local search algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Finding the maximum multi improvement on neighborhood exploration

Uses Software

• TSPLIB
• OR-Library

This page was built for publication: Parallel local search for Steiner trees in graphs