Optimization models and algorithms for the hyperplane clustering problem
From MaRDI portal
(Redirected from Publication:989832)
Recommendations
- A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- On the multisource hyperplanes location problem to fitting set of points
- scientific article; zbMATH DE number 4007495
Cites work
Cited in
(8)- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- New global optimization algorithms for model-based clustering
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- Global optimization in clustering using hyperbolic cross points
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- A hierarchical approach for sparse source blind signal separation problem
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
This page was built for publication: Optimization models and algorithms for the hyperplane clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989832)