Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CirCut / rank | |||
Normal rank | |||
Revision as of 20:12, 29 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
