Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints |
scientific article |
Statements
Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (English)
0 references
22 January 2020
0 references
maximum \(k\)-cut
0 references
graph partitioning
0 references
semidefinite programming
0 references
eigenvalue constraint
0 references
semi-infinite formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references