An algorithm for 0-1 multiple-knapsack problems (Q4175050)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for 0-1 multiple-knapsack problems |
scientific article; zbMATH DE number 3611075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for 0-1 multiple-knapsack problems |
scientific article; zbMATH DE number 3611075 |
Statements
An algorithm for 0-1 multiple-knapsack problems (English)
0 references
1978
0 references
Branch-And-Bound Algorithm
0 references
Multiple Knapsack Problem
0 references
