Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
type: Item
instance of: scholarly article
title: Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
zbMATH Open document ID: 1487.90649
author: Xiangjing Lai
author: Jin-Kao Hao
author: Zhanghua Fu
author: Dong Yue
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354517
zbMATH Keywords: heuristics
zbMATH Keywords: grouping and clustering
zbMATH Keywords: neighborhood decomposition
zbMATH Keywords: local search
describes a project that uses: Graclus
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.048
OpenAlex ID: W3046190147
cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
cites work: A class of bounded approximation algorithms for graph partitioning
cites work: Q4354785
cites work: A cutting plane algorithm for a clustering problem
cites work: Variable neighborhood search: Principles and applications
cites work: Operational research in education
cites work: Constrained group balancing: why does it work
cites work: Iterated maxima search for the maximally diverse grouping problem
cites work: Q4452900
cites work: An artificial bee colony algorithm for the maximally diverse grouping problem
cites work: Variable neighborhood search for maximum diverse grouping problem
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
cites work: A three-phased local search approach for the clique partitioning problem
DOI: 10.1016/J.EJOR.2020.07.048
description: scientific article; zbMATH DE number 7354517