A two-phase heuristic for the bottleneck k-hyperplane clustering problem

DOI10.1007/S10589-013-9567-2zbMATH Open1287.90036OpenAlexW1985573233MaRDI QIDQ2636610FDOQ2636610

Authors: E. Amaldi, Kanika Dhyani, Leo Liberti 

Publication date: 30 January 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9567-2

Recommendations

• A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• On the multisource hyperplanes location problem to fitting set of points
• Exact \(L_{2}\)-norm plane separation

zbMATH Keywords

heuristicsapproximationshyperplane clustering\(k\)-hyperplane center problemhyperplane cover problemmixed-integer nonlinear formulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Cites Work

• A clustering technique for the identification of piecewise affine systems
• Title not available (Why is that?)
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Locating lines and hyperplanes. Theory and algorithms
• Writing global optimization software
• Median hyperplanes in normed spaces -- a survey
• \(k\)-plane clustering
• A bilinear algorithm for sparse representations
• Covering things with things
• Title not available (Why is that?)
• Optimization models and algorithms for the hyperplane clustering problem
• On the complexity of locating linear facilities in the plane
• Fitting hyperplanes by minimizing orthogonal deviations
• Title not available (Why is that?)
• Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
• Approximation algorithms for projective clustering
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cited In (3)

• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Optimization models and algorithms for the hyperplane clustering problem
• The equivalence between principal component analysis and nearest flat in the least square sense

Uses Software

• SNOPT
• AMPL
• CPLEX
• Bonmin

This page was built for publication: A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636610)