Copositivity cuts for improving SDP bounds on the clique number (Q2638373): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: YALMIP / rank | |||
Normal rank | |||
Revision as of 06:29, 29 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
