Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational study of a branching algorithm for the maximum \(k\)-cut problem |
scientific article |
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 references
