Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
From MaRDI portal
Recommendations
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
- scientific article; zbMATH DE number 4007495
- On the multisource hyperplanes location problem to fitting set of points
- Optimization models and algorithms for the hyperplane clustering problem
Cites work
- \(k\)-plane clustering
- A recipe for finding good solutions to MINLPs
- Approximation algorithms for projective clustering
- Covering things with things
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- On the complexity of locating linear facilities in the plane
- Writing global optimization software
Cited in
(8)- A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- Box-bisection for solving second-degree systems and the problem of clustering
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
- An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
- Mathematical programming formulations for the collapsed k-core problem
- A spatially constrained fuzzy hyper-prototype clustering algorithm
- Optimization models and algorithms for the hyperplane clustering problem
This page was built for publication: Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627678)
