A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116)
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: A multi-level search strategy for the 0-1 multidimensional knapsack problem |
scientific article; zbMATH DE number 5703711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-level search strategy for the 0-1 multidimensional knapsack problem |
scientific article; zbMATH DE number 5703711 |
Statements
A multi-level search strategy for the 0-1 multidimensional knapsack problem (English)
0 references
5 May 2010
0 references
resolution search
0 references
branch \& bound
0 references
reduced costs
0 references
0-1 multidimensional knapsack problem
0 references
0 references
0 references
0 references
0.8269283771514893
0 references
0.8233138918876648
0 references
0.8196070194244385
0 references
0.8027518391609192
0 references
0.8019805550575256
0 references
