An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems (Q4906120)
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 6135062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved convex 0-1 quadratic program reformulation for quadratic knapsack problems |
scientific article; zbMATH DE number 6135062 |
Statements
7 February 2013
0 references
quadratic knapsack problem
0 references
convex 0-1 QP reformulation
0 references
convex relaxation
0 references
SDP relaxation
0 references
0.8910882472991943
0 references
0.8280836939811707
0 references
0.8220425248146057
0 references
0.8093504905700684
0 references
0.8082735538482666
0 references
