Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793)
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: Solving k-cluster problems to optimality with semidefinite programming |
scientific article; zbMATH DE number 6116942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving \(k\)-cluster problems to optimality with semidefinite programming |
scientific article; zbMATH DE number 6116942 |
Statements
Solving \(k\)-cluster problems to optimality with semidefinite programming (English)
0 references
19 December 2012
0 references
\(k\)-cluster
0 references
exact resolution
0 references
Lagrangian relaxation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9181230664253236
0 references
0.8766829967498779
0 references
0.8075613379478455
0 references
0.80403071641922
0 references
0.7879422307014465
0 references
