A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
type: Item
instance of: scholarly article
title: A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
zbMATH Open document ID: 1475.68363
author: Qing Zhou
author: Una Benlic
author: Qinghua Wu
published in: Information Sciences
publication date: 2021-11-30T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7436037
zbMATH Keywords: heuristics
zbMATH Keywords: clustering problems
zbMATH Keywords: memetic algorithm
zbMATH Keywords: reformulation local search
describes a project that uses: SparseMatrix
describes a project that uses: TSPLIB
describes a project that uses: J-MEANS
describes a project that uses: Tabu search
describes a project that uses: irace
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ins.2020.06.056
OpenAlex ID: W3041462991
cites work: NP-hardness of Euclidean sum-of-squares clustering
cites work: An improved column generation algorithm for minimum sum-of-squares clustering
cites work: Computational study of large-scale \(p\)-median problems
cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
cites work: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
cites work: A note on solving large p-median problems
cites work: A new local search for continuous location problems
cites work: Using injection points in reformulation local search for solving continuous location problems
cites work: Sum-of-squares clustering on networks
cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks
cites work: The university of Florida sparse matrix collection
cites work: A Branch Decomposition Algorithm for the p-Median Problem
cites work: Q4245749
cites work: Variable neighborhood search for the p-median
cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering
cites work: Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
cites work: Finite Dominating Sets for Network Location Problems
cites work: A tabu search based memetic algorithm for the Max-Mean dispersion problem
cites work: A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
cites work: Hybrid evolutionary search for the traveling repairman problem with profits
cites work: An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
cites work: J-means and I-means for minimum sum-of-squares clustering on networks
cites work: A heuristic algorithm for solving the minimum sum-of-squares clustering problems
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: A hybrid metaheuristic method for the maximum diversity problem
DOI: 10.1016/J.INS.2020.06.056
description: scientific article; zbMATH DE number 7436037