CP-Lib: Benchmark instances of the clique partitioning problem

Sorensen, Michael and Letchford, Adam (2024) CP-Lib: Benchmark instances of the clique partitioning problem. Mathematical Programming Computation, 16 (1): 1. pp. 93-111. ISSN 1867-2949

Text (CP-Lib)
CP-Lib.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (309kB)

Abstract

The Clique Partitioning Problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, with many applications. Several families of benchmark instances have been created in the past, but they are scattered across the literature and hard to find. To remedy this situation, we present CP-Lib, an online resource that contains most of the known instances, plus some challenging new ones.