Clustering search algorithm for the capacitated centered clustering problem
type: Item
instance of: scholarly article
title: Clustering search algorithm for the capacitated centered clustering problem
zbMATH Open document ID: 1173.90413
author: Luiz Antonio Nogueira Lorena
author: A. A. Chaves
published in: Computers \& Operations Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5634682
zbMATH Keywords: clustering problems
zbMATH Keywords: clustering search algorithm
zbMATH Keywords: hybrid metaheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2008.09.011
OpenAlex ID: W1973557230
Wikidata QID: Q58525156
cites work: A tree search algorithm for the p-median problem
cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search
cites work: The capacitated centred clustering problem
cites work: Optimization by Simulated Annealing
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
cites work: A scatter search heuristic for the capacitated clustering problem
cites work: An effective VNS for the capacitated \(p\)-median problem
cites work: Q4229604
cites work: Q3598873
cites work: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
cites work: Q4352217
DOI: 10.1016/J.COR.2008.09.011
DBLP publication ID: journals/cor/ChavesL10
description: scientific article; zbMATH DE number 5634682