Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806)
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: Local search with perturbations for the prize-collecting Steiner tree problem in graphs |
scientific article; zbMATH DE number 1658284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search with perturbations for the prize-collecting Steiner tree problem in graphs |
scientific article; zbMATH DE number 1658284 |
Statements
Local search with perturbations for the prize-collecting Steiner tree problem in graphs (English)
0 references
14 October 2001
0 references
Steiner problem
0 references
path-relinking
0 references
variable neighborhood search
0 references
network design
0 references
0.9020315
0 references
0.89636177
0 references
0.8958578
0 references
0.89569366
0 references
0.89166677
0 references
0.8914728
0 references
0.89099187
0 references
