Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5267317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints |
scientific article; zbMATH DE number 5267317 |
Statements
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (English)
0 references
24 April 2008
0 references
prize collecting
0 references
network design
0 references
Steiner tree problem
0 references
budget
0 references
hop constraints
0 references
heuristics
0 references
tabu search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8884096741676331
0 references
0.8488666415214539
0 references
0.8343579769134521
0 references
0.8260107636451721
0 references
0.8135755658149719
0 references
