Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:35, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations |
scientific article |
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
