Solving the clique partitioning problem as a maximally diverse grouping problem

DOI10.1007/s11590-015-0869-4zbMath1382.90109OpenAlexW2080943874MaRDI QIDQ1677299

Nenad Mladenović, Dragan Urošević, Jack Brimberg, Stefana Janićijević

Publication date: 10 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0869-4

zbMATH Keywords

variable neighborhood searchclique partitioningmaximum diverse grouping problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

A three-phased local search approach for the clique partitioning problem ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Fixed set search applied to the clique partitioning problem ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ Solving the capacitated clustering problem with variable neighborhood search ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

Uses Software

• final exam scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Solving group technology problems via clique partitioning
• Variable neighbourhood search: methods and applications
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Variable neighborhood search
• Noising methods for a clique partitioning problem
• Variable neighborhood search for maximum diverse grouping problem
• An empirical comparison of heuristic methods for creating maximally diverse groups
• The clique partitioning problem: Facets and patching facets
• Design of balanced MBA student teams
• Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis

This page was built for publication: Solving the clique partitioning problem as a maximally diverse grouping problem