Combining semidefinite and polyhedral relaxations for integer programs (Q5101410)
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 7577886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining semidefinite and polyhedral relaxations for integer programs |
scientific article; zbMATH DE number 7577886 |
Statements
Combining semidefinite and polyhedral relaxations for integer programs (English)
0 references
30 August 2022
0 references
constrained \(0-1\) quadratic programming
0 references
quadratic knapsack problem
0 references
0.870089590549469
0 references
0.8491734266281128
0 references
0.8454161882400513
0 references
0.8395460247993469
0 references
0.838651716709137
0 references
