Copositivity cuts for improving SDP bounds on the clique number (Q2638373): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Copositivity cuts for improving SDP bounds on the clique number |
scientific article |
Statements
Copositivity cuts for improving SDP bounds on the clique number (English)
0 references
16 September 2010
0 references
Lovász' bound
0 references
semidefinite programming
0 references
maximum clique problem
0 references
