Review of basic local searches for solving the minimum sum-of-squares clustering problem

DOI10.1007/978-3-319-99142-9_13zbMath1421.90067OpenAlexW2903258907MaRDI QIDQ2325257

Thiago Pereira, Daniel Aloise, Nenad Mladenović, Jack Brimberg

Publication date: 9 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-99142-9_13

zbMATH Keywords

clusteringVNSK-meansminimum sum-of-squares

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

An efficient heuristic for the \(k\)-partitioning problem ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering

This page was built for publication: Review of basic local searches for solving the minimum sum-of-squares clustering problem