A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707)
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: A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem |
scientific article; zbMATH DE number 5973862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem |
scientific article; zbMATH DE number 5973862 |
Statements
A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (English)
0 references
17 November 2011
0 references
minimum \(k\)-partition
0 references
semidefinite programming
0 references
branch-and-cut
0 references
polyhedral cuts
0 references
0 references
0 references
0 references
0.8376947045326233
0 references
0.8096891641616821
0 references
0.8054613471031189
0 references
0.80403071641922
0 references
