A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571)
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 best first search exact algorithm for the multiple-choice multidimensional knapsack problem |
scientific article; zbMATH DE number 5229102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best first search exact algorithm for the multiple-choice multidimensional knapsack problem |
scientific article; zbMATH DE number 5229102 |
Statements
A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (English)
0 references
22 January 2008
0 references
sequential algorithm
0 references
0 references
0.8496747612953186
0 references
0.8440088629722595
0 references
0.8424153327941895
0 references
0.8416191935539246
0 references
0.8339114785194397
0 references
