Solution of the zero-one multiple knapsack problem (Q1142701): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Loading and Unloading of Liquids into Tanks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank | |||
Normal rank | |||
| 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 | |||
Latest revision as of 05:43, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of the zero-one multiple knapsack problem |
scientific article |
Statements
Solution of the zero-one multiple knapsack problem (English)
0 references
1980
0 references
zero-one multiple knapsack problem
0 references
branch and bound scheme
0 references
different branching strategies
0 references
bounding procedures
0 references
computational performance
0 references
combinatorial optimization
0 references
solution algorithm
0 references
