A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324)
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: A branch-and-bound algorithm for solving max-\(k\)-cut problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for solving max-\(k\)-cut problem |
scientific article |
Statements
A branch-and-bound algorithm for solving max-\(k\)-cut problem (English)
0 references
29 September 2021
0 references
max-\(k\)-cut
0 references
semidefinite relaxation
0 references
branch-and-bound algorithm
0 references
