VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM

DOI10.22190/FUMI1905957RzbMath1474.90385OpenAlexW3009238117MaRDI QIDQ3388639

Viktor Orlov, Lev A. Kazakovtsev, Ivan Rozhnov

Publication date: 6 May 2021

Published in: Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22190/fumi1905957r

zbMATH Keywords

clustering problemGPUgreedy heuristic\(k\)-means problemvariable neighborhoods

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

\(k\)-means genetic algorithms with greedy genetic operators

Uses Software

• UCI-ml

This page was built for publication: VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM