CP-Lib: Benchmark instances of the clique partitioning problem

TY - JOUR

T1 - CP-Lib: Benchmark instances of the clique partitioning problem

AU - Sørensen, Michael Malmros

AU - Letchford, Adam N.

PY - 2024/3

Y1 - 2024/3

N2 - 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.

AB - 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.

KW - 90-11

KW - 90C27

KW - Clique partitioning problem

KW - Combinatorial optimisation

UR - http://www.scopus.com/inward/record.url?scp=85175609126&partnerID=8YFLogxK

U2 - 10.1007/s12532-023-00249-1

DO - 10.1007/s12532-023-00249-1

M3 - Journal article

SN - 1867-2949

VL - 16

SP - 93

EP - 111

JO - Mathematical Programming Computation

JF - Mathematical Programming Computation

IS - 1

ER -