Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational study of valid inequalities for the maximum \(k\)-cut problem |
scientific article; zbMATH DE number 6916964
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational study of valid inequalities for the maximum \(k\)-cut problem |
scientific article; zbMATH DE number 6916964 |
Statements
Computational study of valid inequalities for the maximum \(k\)-cut problem (English)
0 references
13 August 2018
0 references
maximum \(k\)-cut
0 references
graph partitioning
0 references
semidefinite programming
0 references
computational study
0 references
0 references
0 references
0 references
0 references
0 references
