Parallel local search for Steiner trees in graphs (Q1808193)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel local search for Steiner trees in graphs |
scientific article; zbMATH DE number 1373554
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel local search for Steiner trees in graphs |
scientific article; zbMATH DE number 1373554 |
Statements
Parallel local search for Steiner trees in graphs (English)
0 references
2 December 1999
0 references
Steiner tree problem
0 references
traveling salesman problem
0 references
parallel local search algorithm
0 references
multiple-step parallelism
0 references
0.9406244
0 references
0.9397523
0 references
0.9199044
0 references
0.9194512
0 references
0.9095683
0 references
0.9033642
0 references
0.89781344
0 references
0.8968804
0 references
