Determining the \(K\)-best solutions of knapsack problems (Q342015)
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 6654014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining the \(K\)-best solutions of knapsack problems |
scientific article; zbMATH DE number 6654014 |
Statements
Determining the \(K\)-best solutions of knapsack problems (English)
0 references
17 November 2016
0 references
knapsack problems
0 references
branch-and-bound
0 references
best solutions
0 references
0 references
0 references
0 references
0.8254702687263489
0 references
0.8000500798225403
0 references
0.7968288660049438
0 references
