CP-Lib: Benchmark instances of the clique partitioning problem

Michael Malmros Sørensen; Adam N. Letchford

doi:10.1007/s12532-023-00249-1

CP-Lib: Benchmark instances of the clique partitioning problem

Michael Malmros Sørensen^*, Adam N. Letchford

^*Corresponding author for this work

Department of Economics and Business Economics

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-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 language	English
Journal	Mathematical Programming Computation
Volume	16
Issue	1
Pages (from-to)	93-111
Number of pages	19
ISSN	1867-2949
DOIs	https://doi.org/10.1007/s12532-023-00249-1
Publication status	Published - Mar 2024

Keywords

90-11
90C27
Clique partitioning problem
Combinatorial optimisation

Access to Document

10.1007/s12532-023-00249-1

CP-LibAccepted manuscript, 302 KB

Library access?

Check availability with the Royal Danish Library

Cite this

@article{3fc01f4f26de424f873ea8b107f16f06,

title = "CP-Lib: Benchmark instances of the clique partitioning problem",

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.",

keywords = "90-11, 90C27, Clique partitioning problem, Combinatorial optimisation",

author = "S{\o}rensen, {Michael Malmros} and Letchford, {Adam N.}",

year = "2024",

month = mar,

doi = "10.1007/s12532-023-00249-1",

language = "English",

volume = "16",

pages = "93--111",

journal = "Mathematical Programming Computation",

issn = "1867-2949",

publisher = "Springer",

number = "1",

}

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 -

CP-Lib: Benchmark instances of the clique partitioning problem

Abstract

Keywords

Access to Document

Library access?

Other files and links

Fingerprint

Cite this