Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837): Difference between revisions
From MaRDI portal
Latest revision as of 11:05, 2 July 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references