A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249)
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 5226829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems |
scientific article; zbMATH DE number 5226829 |
Statements
A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (English)
0 references
14 January 2008
0 references
multi-dimensional quadratic \(0\)-\(1\) knapsack problem
0 references
branch-and-bound method
0 references
Lagrangian relaxation
0 references
0.9115817546844482
0 references
0.8437392711639404
0 references
0.8398759961128235
0 references
0.8191208243370056
0 references
0.8177013993263245
0 references
