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

DOI10.1007/S11590-015-0974-4zbMATH Open1369.90180OpenAlexW2290204980MaRDI QIDQ526420FDOQ526420

Authors: Alexey Nikolaev, Nenad Mladenović, 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

Recommendations

• Variable neighborhood search for minimum sum-of-squares clustering on networks
• Review of basic local searches for solving the minimum sum-of-squares clustering problem
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• Sum-of-squares clustering on networks
• Variable neighborhood search for harmonic means clustering

zbMATH Keywords

K-meansheuristicvariable neighborhood searchJ-meansminimum sum-of-squares clustering

Mathematics Subject Classification ID

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

Cites Work

• A note on solving large p-median problems
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Title not available (Why is that?)
• NP-hardness of Euclidean sum-of-squares clustering
• Cluster analysis and mathematical programming
• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• 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
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• Degeneracy in the multi-source Weber problem
• Sum-of-squares clustering on networks
• Finite Dominating Sets for Network Location Problems
• New heuristic for harmonic means clustering

Cited In (4)

• Sum-of-squares clustering on networks
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• Review of basic local searches for solving the minimum sum-of-squares clustering problem
• Variable neighborhood search for minimum sum-of-squares clustering on networks

Uses Software

• J-MEANS
• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526420)