Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769)
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 6535033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints |
scientific article; zbMATH DE number 6535033 |
Statements
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (English)
0 references
25 January 2016
0 references
constrained Steiner trees
0 references
evolutionary computation
0 references
heuristics
0 references
dynamic programming
0 references
content distribution networks
0 references
0 references
0 references
0 references
0 references
0 references
0.8846799
0 references
0.8830697
0 references
0.8828415
0 references
0.87858254
0 references
0.87318474
0 references
