Parallel local search for Steiner trees in graphs
type: Item
instance of: scholarly article
title: Parallel local search for Steiner trees in graphs
zbMATH Open document ID: 0937.90113
DOI: 10.1023/A:1018908614375
author: M. G. A. Verhoeven
author: M. E. M. Severens
published in: Annals of Operations Research
publication date: 1999-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1373554
zbMATH Keywords: Steiner tree problem
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: parallel local search algorithm
zbMATH Keywords: multiple-step parallelism
describes a project that uses: OR-Library
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: a:1018908614375
OpenAlex ID: W198341110
Recommended article: A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
Recommended article: Fast Local Search for Steiner Trees in Graphs
Recommended article: Fast local search for the steiner problem in graphs
Recommended article: A parallel algorithm for computing Steiner trees in strongly chordal graphs
Recommended article: Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
Recommended article: Q4393289
Recommended article: Local search for the Steiner tree problem in the Euclidean plane
Recommended article: A Local-Search Algorithm for Steiner Forest
Recommended article: Parallel search algorithms for graphs and trees
Recommended article: Local search with perturbations for the prize-collecting Steiner tree problem in graphs
description: scientific article; zbMATH DE number 1373554