Solving the capacitated clustering problem with variable neighborhood search
type: Item
instance of: scholarly article
title: Solving the capacitated clustering problem with variable neighborhood search
zbMATH Open document ID: 1409.90155
author: Jack Brimberg
author: Nenad Mladenović
author: Raca Todosijević
author: Dragan Urošević
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7032646
zbMATH Keywords: optimization
zbMATH Keywords: clustering
zbMATH Keywords: heuristic
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: s10479-017-2601-5
OpenAlex ID: W2742664076
cites work: Attraction probabilities in variable neighborhood search
cites work: Solving the clique partitioning problem as a maximally diverse grouping problem
cites work: Variable Neighborhood Descent for the Capacitated Clustering Problem
cites work: A reactive GRASP with path relinking for capacitated clustering
cites work: Tabu search and GRASP for the maximum diversity problem
cites work: Tabu search and GRASP for the capacitated clustering problem
cites work: An artificial bee colony algorithm for the maximally diverse grouping problem
cites work: Variable neighborhood search for maximum diverse grouping problem
DOI: 10.1007/S10479-017-2601-5
description: scientific article; zbMATH DE number 7032646