A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Solution of 0-1 Loading Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the zero-one multiple knapsack problem / rank | |||
Normal rank | |||
Latest revision as of 12:30, 13 June 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
