A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:28, 2 February 2024
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
