J-means and I-means for minimum sum-of-squares clustering on networks
From MaRDI portal
(Redirected from Publication:526420)
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
Cites work
- A note on solving large p-median problems
- An improved column generation algorithm for minimum sum-of-squares clustering
- Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering
- Cluster analysis and mathematical programming
- Degeneracy in the multi-source Weber problem
- Finite Dominating Sets for Network Location Problems
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- New heuristic for harmonic means clustering
- NP-hardness of Euclidean sum-of-squares clustering
- Sum-of-squares clustering on networks
- Variable neighborhood search
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- Variable neighbourhood search: methods and applications
Cited in
(4)- 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
- Sum-of-squares clustering on networks
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)
