A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:23, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound and bound algorithm for the zero-one multiple knapsack problem |
scientific article |
Statements
A bound and bound algorithm for the zero-one multiple knapsack problem (English)
0 references
1981
0 references
bound and bound algorithm
0 references
zero-one multiple knapsack problem
0 references
tree- search technique
0 references
computational results
0 references
integer linear programming
0 references
