Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58002887, #quickstatements; #temporary_batch_1707232231678 |
Removed claim: author (P16): Item:Q240162 |
||
| Property / author | |||
| Property / author: Franz Rendl / rank | |||
Revision as of 12:38, 11 February 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
