TY - JOUR A1 - Sørensen, Michael M. A1 - Letchford, Adam N. T1 - CP-Lib: Benchmark Instances of the Clique Partitioning Problem T2 - Mathematical Programming Computation N2 - The Clique Partitioning Problem is a fundamental and much-studied N P-hard combi- natorial 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. Y1 - 2023 UR - https://opus4.kobv.de/opus4-mpc/frontdoor/index/index/docId/258 SN - 1867-2949 VL - 16 IS - 1 SP - 93 EP - 111 PB - Springer Science and Business Media LLC ER -