A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766)
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 3885227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for solving the multiple-choice knapsack problem |
scientific article; zbMATH DE number 3885227 |
Statements
A branch and bound algorithm for solving the multiple-choice knapsack problem (English)
0 references
1984
0 references
pegging test
0 references
multiple-choice knapsack problem
0 references
branch and bound algorithm
0 references
Computational experience
0 references
comparisons
0 references
0 references
0.8869678974151611
0 references
0.8815042972564697
0 references
0.879328191280365
0 references
