Tabu search: global intensification using dynamic programming (Q3437243)
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: Tabu search: global intensification using dynamic programming |
scientific article; zbMATH DE number 5152601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search: global intensification using dynamic programming |
scientific article; zbMATH DE number 5152601 |
Statements
14 May 2007
0 references
multidimensional \(0-1\) knapsack problem
0 references
0.7720085382461548
0 references
0.7698885798454285
0 references
0.7663277983665466
0 references
