Home > Research > Publications & Outputs > CP-Lib: Benchmark instances of the clique parti...

Associated organisational unit

Electronic data

  • CP-Lib

    Accepted author manuscript, 302 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

CP-Lib: Benchmark instances of the clique partitioning problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

E-pub ahead of print
<mark>Journal publication date</mark>3/11/2023
<mark>Journal</mark>Mathematical Programming Computation
Publication StatusE-pub ahead of print
Early online date3/11/23
<mark>Original language</mark>English

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.