Variable neighborhood search for minimum sum-of-squares clustering on networks

DOI10.1016/j.ejor.2013.04.027zbMath1317.91061MaRDI QIDQ2355953

Emilio Carrizosa, Raca Todosijević, Nenad Mladenović

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107812

zbMATH Keywords

variable neighborhood search; location on networks; minimum sum-of-squares clustering

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

91C20: Clustering in the social and behavioral sciences

Related Items

Nested general variable neighborhood search for the periodic maintenance problem, J-means and I-means for minimum sum-of-squares clustering on networks, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, New diagonal bundle method for clustering problems in large data sets, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, Variable neighborhood search: basics and variants, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, Dominant-set clustering: a review, Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders, Optimization problems for machine learning: a survey, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

Uses Software

• J-MEANS
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• An improved column generation algorithm for minimum sum-of-squares clustering
• Spectral methods for graph clustering - a survey
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• Variable neighbourhood search: methods and applications
• NP-hardness of Euclidean sum-of-squares clustering
• Variable neighbourhood search: Methods and applications
• A note on solving large p-median problems
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Degeneracy in the multi-source Weber problem
• Cluster analysis and mathematical programming
• Variable neighborhood search
• A computational study of a nonlinear minsum facility location problem
• Sum-of-squares clustering on networks
• Solution methods for thep-median problem: An annotated bibliography
• Finite Dominating Sets for Network Location Problems
• Variable neighborhood search for the p-median
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• On the \(p\)-median polytope
• J-MEANS: A new local search heuristic for minimum sum of squares clustering