Optimization models and algorithms for the hyperplane clustering problem
From MaRDI portal
Publication:989832
DOI10.1007/S10288-009-0116-XzbMATH Open1198.90301OpenAlexW1970003295MaRDI QIDQ989832FDOQ989832
Authors: Kanika Dhyani
Publication date: 23 August 2010
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-009-0116-x
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
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
Cited In (8)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- Title not available (Why is that?)
- Global optimization in clustering using hyperbolic cross points
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- A hierarchical approach for sparse source blind signal separation problem
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
- New global optimization algorithms for model-based clustering
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)