CP-Lib: Benchmark instances of the clique partitioning problem

Michael Malmros Sørensen*, Adam N. Letchford

*Corresponding author for this work

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

3 Citations (Scopus)
1 Downloads (Pure)

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.

Original languageEnglish
JournalMathematical Programming Computation
Volume16
Issue1
Pages (from-to)93-111
Number of pages19
ISSN1867-2949
DOIs
Publication statusPublished - Mar 2024

Keywords

  • 90-11
  • 90C27
  • Clique partitioning problem
  • Combinatorial optimisation

Fingerprint

Dive into the research topics of 'CP-Lib: Benchmark instances of the clique partitioning problem'. Together they form a unique fingerprint.

Cite this