Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6654090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster |
scientific article; zbMATH DE number 6654090 |
Statements
Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (English)
0 references
17 November 2016
0 references
combinatorial optimization
0 references
semidefinite programming
0 references
triangle inequalities
0 references
\(k\)-cluster problem
0 references
\(k\)-densest subgraph problem
0 references
0 references
0 references
0.9181230664253236
0 references
0.8404011130332947
0 references
0.8054613471031189
0 references
0.8001927137374878
0 references
0.7802944183349609
0 references
