Algorithm 632: A program for the 0–1 multiple knapsack problem (Q3675904): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968567994 / rank | |||
Normal rank | |||
Latest revision as of 18:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm 632: A program for the 0–1 multiple knapsack problem |
scientific article |
Statements
Algorithm 632: A program for the 0–1 multiple knapsack problem (English)
0 references
1985
0 references
branch and bound
0 references
0-1 multiple knapsack problem
0 references
depth-first tree-search technique
0 references
