Sum-of-squares clustering on networks
From MaRDI portal
Publication:2853254
DOI10.2298/YJOR1102157CzbMath1289.90242MaRDI QIDQ2853254
Nenad Mladenović, Raca Todosijević, Emilio Carrizosa
Publication date: 18 October 2013
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Related Items
Two level general variable neighborhood search for attractive traveling salesman problem, Variable neighborhood search for location routing, Sequential clustering with radius and split criteria, New heuristic for harmonic means clustering, Exponential quality function for community detection in complex networks, Variable neighborhood search for the travelling deliveryman problem, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, New local searches for solving the multi-source Weber problem, J-means and I-means for minimum sum-of-squares clustering on networks, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, Variable neighborhood search for minimum sum-of-squares clustering on networks
