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 this page instead for the normal view: Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques |
scientific article |
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
