A reactive GRASP with path relinking for capacitated clustering
type: Item
instance of: scholarly article
title: A reactive GRASP with path relinking for capacitated clustering
zbMATH Open document ID: 1211.90301
author: Y.-M. Deng
author: Jonathan F. Bard
published in: Journal of Heuristics
publication date: 2011-05-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5886939
zbMATH Keywords: GRASP
zbMATH Keywords: capacitated clustering problem
zbMATH Keywords: path relinking
zbMATH Keywords: variable neighborhood search
describes a project that uses: J-MEANS
describes a project that uses: CPLEX
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: s10732-010-9129-z
OpenAlex ID: W2047569698
cites work: Greedy random adaptive memory programming search for the capacitated clustering problem
cites work: Using clustering analysis in a capacitated location-routing problem
cites work: A reactive GRASP and path relinking for a combined production-distribution problem
cites work: Q4181272
cites work: Q4450056
cites work: Genetic clustering algorithms.
cites work: Greedy randomized adaptive search procedures
cites work: The node capacitated graph partitioning problem: A computational study
cites work: Fundamentals of scatter search and path relinking
cites work: Min-cut clustering
cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering
cites work: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
cites work: A new approach to the minimum cut problem
cites work: A GRASP for the Vehicle Routing Problem with Time Windows
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: Cliques and clustering: A combinatorial approach
cites work: Variable neighborhood search
cites work: Solving capacitated clustering problems
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: The capacitated centred clustering problem
cites work: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
cites work: A GRASP for parallel machine scheduling with time windows
cites work: Improving Discrete Model Representations via Symmetry Considerations
DOI: 10.1007/S10732-010-9129-Z
description: scientific article; zbMATH DE number 5886939