J-means and I-means for minimum sum-of-squares clustering on networks

DOI10.1007/s11590-015-0974-4zbMath1369.90180OpenAlexW2290204980MaRDI QIDQ526420

Nenad Mladenović, Alexey Nikolaev, Raca Todosijević

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0974-4

zbMATH Keywords

heuristicvariable neighborhood searchJ-meansK-meansminimum sum-of-squares clustering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

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
• Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
• An improved column generation algorithm for minimum sum-of-squares clustering
• New heuristic for harmonic means clustering
• Variable neighbourhood search: methods and applications
• NP-hardness of Euclidean sum-of-squares clustering
• A note on solving large p-median problems
• Degeneracy in the multi-source Weber problem
• Cluster analysis and mathematical programming
• Variable neighborhood search
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• Sum-of-squares clustering on networks
• Finite Dominating Sets for Network Location Problems
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: J-means and I-means for minimum sum-of-squares clustering on networks