Optimization models and algorithms for the hyperplane clustering problem

DOI10.1007/s10288-009-0116-xzbMath1198.90301OpenAlexW1970003295MaRDI QIDQ989832

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

zbMATH Keywords

column generationmixed integer nonlinear programminghyperplane clustering

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (2)

A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ A hierarchical approach for sparse source blind signal separation problem

Cites Work

• The MIN PFS problem and piecewise linear model estimation
• \(k\)-plane clustering
• Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem

This page was built for publication: Optimization models and algorithms for the hyperplane clustering problem