This is a solution - implementation of an algorithm that, taking points in n-dimensional space and maximum number of clusters, assigns each point to the appropriate group so that the sum of Euclidean distances between points belonging to the same group is as small as possible.
There is used a genetic algorithm combined with the k-means algorithm.
This was the solution for a competition. Competition rules and content
I eventually took 9th place in the competition. Diploma
The solution focused mainly on performance/time efficiency and on giving the best results.
C++, OpenMP