Less is more: simple algorithms for the minimum sum of squares clustering problem

DOI10.1093/IMAMAN/DPAB031MaRDI QIDQ5091799zbMATH OpenOpenAlexFDO

Authors Jack Brimberg, Zvi Drezner, Pawel Kalczynski

Publication date 27 July 2022

Published in IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imaman/dpab031

zbMATH Keywords

clustering algorithmsheuristicslocal searchlocationstarting solutions

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cited in

(4)

• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• scientific article; zbMATH DE number 1931840 (Why is no real title available?)
• scientific article; zbMATH DE number 7416587 (Why is no real title available?)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering

This page was built for publication: Less is more: simple algorithms for the minimum sum of squares clustering problem

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