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

DOI10.1007/S12532-023-00249-1MaRDI QIDQ6548518zbMATH OpenFDO

Authors Michael Malmros Sørensen, Adam N. Letchford

Publication date 1 June 2024

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

Full work available at URL https://doi.org/10.1007/S12532-023-00249-1

zbMATH Keywords

clique partitioning problemcombinatorial optimisation

Mathematics Subject Classification ID

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

Recommendations

• New bounds and constraint propagation techniques for the clique partitioning problem
• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• Lagrangian relaxation and pegging test for the clique partitioning problem
• scientific article; zbMATH DE number 15357
• Concise integer linear programming formulation for clique partitioning problems

Cites work

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

Cited in

(1)

• Corrigendum to: ``A polyhedral study of lifted multicuts

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

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