Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691)
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 6478551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques |
scientific article; zbMATH DE number 6478551 |
Statements
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (English)
0 references
4 September 2015
0 references
MAX-cut relaxation
0 references
MAX-clique problem
0 references
semidefinite program
0 references
completely positive program
0 references
0 references
0 references
0 references
0 references
0 references
0.8079056143760681
0 references
0.8078426718711853
0 references
0.7969602346420288
0 references
0.7969598770141602
0 references
0.791155219078064
0 references
