Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDP_S / rank | |||
Normal rank | |||
Revision as of 04:58, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving \(k\)-cluster problems to optimality with semidefinite programming |
scientific article |
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
