Solving the clique partitioning problem as a maximally diverse grouping problem
type: Item
instance of: scholarly article
title: Solving the clique partitioning problem as a maximally diverse grouping problem
zbMATH Open document ID: 1382.90109
author: Jack Brimberg
author: Stefana Janićijević
author: Nenad Mladenović
author: Dragan Urošević
published in: Optimization Letters
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6805892
zbMATH Keywords: clique partitioning
zbMATH Keywords: maximum diverse grouping problem
zbMATH Keywords: variable neighborhood search
describes a project that uses: final exam scheduling
MaRDI profile type: Publication
full work available at URL: s11590-015-0869-4
OpenAlex ID: W2080943874
cites work: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
cites work: Noising methods for a clique partitioning problem
cites work: Design of balanced MBA student teams
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood search
cites work: Q5525682
cites work: Q4742505
cites work: The clique partitioning problem: Facets and patching facets
cites work: Variable neighborhood search for maximum diverse grouping problem
cites work: Solving group technology problems via clique partitioning
cites work: Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
DOI: 10.1007/S11590-015-0869-4
description: scientific article; zbMATH DE number 6805892