A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610)
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 two-phase heuristic for the bottleneck k-hyperplane clustering problem |
scientific article; zbMATH DE number 6252369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem |
scientific article; zbMATH DE number 6252369 |
Statements
A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (English)
0 references
30 January 2014
0 references
hyperplane clustering
0 references
hyperplane cover problem
0 references
\(k\)-hyperplane center problem
0 references
mixed-integer nonlinear formulation
0 references
approximations
0 references
heuristics
0 references
0.8568465113639832
0 references
0.8117415308952332
0 references
0.7327901721000671
0 references
0.7313748598098755
0 references
0.7247914671897888
0 references
