A bundle approach for SDPs with exact subgraph constraints (Q2293089)
From MaRDI portal
!
WARNING
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 7164360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bundle approach for SDPs with exact subgraph constraints |
scientific article; zbMATH DE number 7164360 |
Statements
A bundle approach for SDPs with exact subgraph constraints (English)
0 references
6 February 2020
0 references
semidefinite programming
0 references
relaxation hierarchy
0 references
max-cut
0 references
stable set
0 references
coloring
0 references
0.93501877784729
0 references
0.8124967813491821
0 references
0.7989976406097412
0 references
0.7970069646835327
0 references
