A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy (Q5928213)
From MaRDI portal
scientific article; zbMATH DE number 1582188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy |
scientific article; zbMATH DE number 1582188 |
Statements
A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy (English)
0 references
2000
0 references
The search for a minimum weighted subtree of \(G\) spanning all prescribed terminal nodes is known as the Steiner problem (SPG). The decision version of the problem is known to be NP-complete. The paper presents a hybrid parallel greedy randomized adaptive search procedure (hybrid GRASP) for SPG based on two neighborhood search strategies.
0 references
combinatorial optimization
0 references
GRASP
0 references
local search
0 references
heuristics
0 references
Steiner problem
0 references
