\texttt{CP-Lib}: benchmark instances of the clique partitioning problem

DOI10.1007/s12532-023-00249-1zbMath1539.90097MaRDI QIDQ6548518

Adam N. Letchford, Michael Malmros Sørensen

Publication date: 1 June 2024

Published in: Mathematical Programming Computation (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimisationclique partitioning problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cites Work

• Unnamed Item
• Unnamed Item
• A three-phased local search approach for the clique partitioning problem
• Exact algorithms for cluster editing: Evaluation and experiments
• Correlation clustering
• Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
• Solving group technology problems via clique partitioning
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Grouping of parts and components in flexible manufacturing systems
• A cutting plane algorithm for a clustering problem
• A branch-and-cut algorithm for the equicut problem
• Solving the clique partitioning problem as a maximally diverse grouping problem
• Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
• Lagrangian relaxation and pegging test for the clique partitioning problem
• The partition problem
• New bounds and constraint propagation techniques for the clique partitioning problem
• Noising methods for a clique partitioning problem
• Clustering of microarray data via clique partitioning
• The equipartition polytope. I: Formulations, dimension and basic facets
• A close neighbour algorithm for designing cellular manufacturing systems
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
• Clique-Web Facets for Multicut Polytopes
• Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group technology
• A pragmatic approach to machine and part grouping in cellular manufacturing system design
• An application of fuzzy clustering to cellular manufacturing
• Design and scheduling of hybridmulti-cell flexible manufacturing systems
• Fast Clustering Algorithms
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• The clique partitioning problem: Facets and patching facets
• The Branch and Cut Method for the Clique Partitioning Problem
• Problem Decomposition and Data Reorganization by a Clustering Technique
• Fixed set search applied to the clique partitioning problem

This page was built for publication: \texttt{CP-Lib}: benchmark instances of the clique partitioning problem