84 citations · 84 across the 3 of their papers we have counts for
3 papers
How to Use K-means for Big Data Clustering?
Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui +1
K-means plays a vital role in data mining and is the simplest and most widely used algorithm under the Euclidean Minimum Sum-of-Squares Clustering (MSSC) model. However, its perfor…
Towards an intelligent VNS heuristic for the k-labelled spanning forest problem
Sergio Consoli, Josè Andrès Moreno Pèrez, Nenad Mladenovic
In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS)…
Solving the minimum labelling spanning tree problem using intelligent optimization
Sergio Consoli, Nenad Mladenovic, Jose Andres Moreno-Perez
Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest n…