A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766): Difference between revisions
From MaRDI portal
Latest revision as of 15:36, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch and bound algorithm for solving the multiple-choice knapsack problem |
scientific article |
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