Heuristic methods for large centroid clustering problems
type: Item
instance of: scholarly article
title: Heuristic methods for large centroid clustering problems
zbMATH Open document ID: 1035.90038
DOI: 10.1023/A:1021841728075
author: Éric D. Taillard
published in: Journal of Heuristics
publication date: 2003-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1972145
zbMATH Keywords: clustering
zbMATH Keywords: location-allocation
zbMATH Keywords: \(p\)-median
zbMATH Keywords: sum-of-squares clustering
zbMATH Keywords: multi-source Weber problem
describes a project that uses: POPMUSIC
MaRDI profile type: Publication
full work available at URL: a:1021841728075
OpenAlex ID: W1603665682
Recommended article: Approximation schemes for clustering problems
Recommended article: A heuristic algorithm for solving the minimum sum-of-squares clustering problems
Recommended article: Q4368558
Recommended article: Clustering heuristics for set covering
Recommended article: Heuristic search to the capacitated clustering problem
Recommended article: Q3115255
Recommended article: Exact and approximation algorithms for clustering
Recommended article: A heuristic approach to possibilistic clustering. Algorithms and applications
Recommended article: A matheuristic for large-scale capacitated clustering
description: scientific article; zbMATH DE number 1972145