An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6037916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the budget-constrained multiple knapsack problem |
scientific article; zbMATH DE number 6037916 |
Statements
An exact algorithm for the budget-constrained multiple knapsack problem (English)
0 references
23 May 2012
0 references
multiple knapsack problem
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
0.8701208829879761
0 references
0.8429985046386719
0 references
0.8340450525283813
0 references
0.8201080560684204
0 references
0.8109762668609619
0 references
