Tabu search and GRASP for the capacitated clustering problem
type: Item
instance of: scholarly article
title: Tabu search and GRASP for the capacitated clustering problem
zbMATH Open document ID: 1334.90190
author: Anna Martínez-Gavara
author: Vicente Campos
author: Micael Gallego
author: Manuel Laguna
author: Rafael Martí
published in: Computational Optimization and Applications
publication date: 2015-10-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6499535
zbMATH Keywords: capacitated clustering
zbMATH Keywords: diversity problems
zbMATH Keywords: tabu search
zbMATH Keywords: GRASP
zbMATH Keywords: graph partitioning
describes a project that uses: TTTPLOTS
describes a project that uses: Tabu search
describes a project that uses: GRASP
describes a project that uses: PERL
MaRDI profile type: Publication
full work available at URL: s10589-015-9749-1
OpenAlex ID: W2113215688
cites work: TTT plots: a perl program to create time-to-target plots
cites work: A reactive GRASP with path relinking for capacitated clustering
cites work: One-Half Approximation Algorithms for the k-Partition Problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: Hybrid heuristics for the maximum diversity problem
cites work: Q4354785
cites work: GRASP and path relinking for the equitable dispersion problem
cites work: A hybrid GRASP with perturbations for the Steiner problem in graphs
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
DOI: 10.1007/S10589-015-9749-1
description: scientific article; zbMATH DE number 6499535