A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
From MaRDI portal
Publication:2053830
DOI10.1016/j.ins.2020.06.056zbMath1475.68363OpenAlexW3041462991MaRDI QIDQ2053830
Qing Zhou, Una Benlic, Qinghua Wu
Publication date: 30 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.056
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- J-means and I-means for minimum sum-of-squares clustering on networks
- An improved column generation algorithm for minimum sum-of-squares clustering
- Computational study of large-scale \(p\)-median problems
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- NP-hardness of Euclidean sum-of-squares clustering
- A note on solving large p-median problems
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- A hybrid heuristic for the \(p\)-median problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Hybrid evolutionary search for the traveling repairman problem with profits
- A new local search for continuous location problems
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- A hybrid metaheuristic method for the maximum diversity problem
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Sum-of-squares clustering on networks
- The university of Florida sparse matrix collection
- Finite Dominating Sets for Network Location Problems
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- A Branch Decomposition Algorithm for the p-Median Problem
- Using injection points in reformulation local search for solving continuous location problems
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
