Strengthened semidefinite programming relaxations for the max-cut problem. (Q2768060)
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: Strengthened semidefinite programming relaxations for the max-cut problem. |
scientific article; zbMATH DE number 1698952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strengthened semidefinite programming relaxations for the max-cut problem. |
scientific article; zbMATH DE number 1698952 |
Statements
2001
0 references
discrete optimization
0 references
Lagrangian relaxation
0 references
semidefinite relaxations
0 references
cut polytope
0 references
metric polytope
0 references
Max-Cut problem
0 references
semidefinite programming
0 references
Strengthened semidefinite programming relaxations for the max-cut problem. (English)
0 references
0.9065099358558656
0 references
0.8947887420654297
0 references
0.8484900593757629
0 references
