Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-015-9731-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-015-9731-Y / rank | |||
Normal rank | |||
Latest revision as of 19:17, 9 December 2024
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
