Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837)
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: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations |
scientific article; zbMATH DE number 5673352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations |
scientific article; zbMATH DE number 5673352 |
Statements
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (English)
0 references
19 February 2010
0 references
cut polytope
0 references
unconstrained binary quadratic optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.95236313
0 references
0.94205165
0 references
0.9398075
0 references
0.93321824
0 references
0.93308705
0 references
0.9316099
0 references
0.9313368
0 references
0.9253836
0 references
