A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-0427(84)90023-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045247420 / rank | |||
Normal rank | |||
Revision as of 23:32, 19 March 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
