An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909)
From MaRDI portal
!
WARNING
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 2126920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem |
scientific article; zbMATH DE number 2126920 |
Statements
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (English)
0 references
12 January 2005
0 references
0--1 quadratic programming
0 references
Knapsack
0 references
Lagrangian decomposition
0 references
Branch-and-bound
0 references
Computational results
0 references
0.9246724843978882
0 references
0.8906353712081909
0 references
0.8755576610565186
0 references
0.8623713850975037
0 references
0.8561282157897949
0 references
