Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7538838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational study of a branching algorithm for the maximum \(k\)-cut problem |
scientific article; zbMATH DE number 7538838 |
Statements
Computational study of a branching algorithm for the maximum \(k\)-cut problem (English)
0 references
9 June 2022
0 references
maximum \(k\)-cut
0 references
branch-and-cut
0 references
graph partitioning
0 references
semidefinite programming
0 references
eigenvalue constraint
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8677823543548584
0 references
0.8272930979728699
0 references
0.8096891641616821
0 references
0.7900714874267578
0 references
0.7889614701271057
0 references
