A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s10898-021-00999-z / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10898-021-00999-Z / rank | |||
Normal rank |
Latest revision as of 14:30, 17 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references