Solving the clique partitioning problem as a maximally diverse grouping problem

DOI10.1007/S11590-015-0869-4MaRDI QIDQ1677299zbMATH OpenOpenAlexFDO

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

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) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• Variable neighborhood search for maximum diverse grouping problem
• Iterated maxima search for the maximally diverse grouping problem
• A heuristic approach for the max-min diversity problem based on max-clique
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• Solving group technology problems via clique partitioning

Cites work

• scientific article; zbMATH DE number 3797446 (Why is no real title available?)
• scientific article; zbMATH DE number 3238209 (Why is no real title available?)
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Design of balanced MBA student teams
• Noising methods for a clique partitioning problem
• Solving group technology problems via clique partitioning
• The clique partitioning problem: Facets and patching facets
• Variable neighborhood search
• Variable neighborhood search for maximum diverse grouping problem
• Variable neighbourhood search: methods and applications

Cited in

(15)

• Variable neighborhood search for maximum diverse grouping problem
• The balanced maximally diverse grouping problem with attribute values
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• An efficient heuristic for the \(k\)-partitioning problem
• A three-phased local search approach for the clique partitioning problem
• 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
• Fixed set search applied to the clique partitioning problem
• A heuristic approach for the max-min diversity problem based on max-clique
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem

Describes a project that uses

Uses Software

• final exam scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677299)