A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Biq Mac / rank | |||
Normal rank | |||
Revision as of 09:47, 28 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
