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

Research

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:

Keywords

View graph of relations

CP-Lib: Benchmark instances of the clique partitioning problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

CP-Lib: Benchmark instances of the clique partitioning problem. / Sorensen, Michael; Letchford, Adam.
In: Mathematical Programming Computation, Vol. 16, No. 1, 1, 01.03.2024, p. 93-111.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Sorensen, M & Letchford, A 2024, 'CP-Lib: Benchmark instances of the clique partitioning problem', Mathematical Programming Computation, vol. 16, no. 1, 1, pp. 93-111. https://doi.org/10.1007/s12532-023-00249-1

APA

Sorensen, M., & Letchford, A. (2024). CP-Lib: Benchmark instances of the clique partitioning problem. Mathematical Programming Computation, 16(1), 93-111. Article 1. https://doi.org/10.1007/s12532-023-00249-1

Vancouver

Sorensen M, Letchford A. CP-Lib: Benchmark instances of the clique partitioning problem. Mathematical Programming Computation. 2024 Mar 1;16(1):93-111. 1. Epub 2023 Nov 3. doi: 10.1007/s12532-023-00249-1

Author

Sorensen, Michael ; Letchford, Adam. / CP-Lib: Benchmark instances of the clique partitioning problem. In: Mathematical Programming Computation. 2024 ; Vol. 16, No. 1. pp. 93-111.

Bibtex

@article{b6cae5290d7d4c78acde8e2509baf436,
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 = "Michael Sorensen and Adam Letchford",
year = "2024",
month = mar,
day = "1",
doi = "10.1007/s12532-023-00249-1",
language = "English",
volume = "16",
pages = "93--111",
journal = "Mathematical Programming Computation",
issn = "1867-2949",
publisher = "Springer Verlag",
number = "1",

}

RIS

TY - JOUR

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

AU - Sorensen, Michael

AU - Letchford, Adam

PY - 2024/3/1

Y1 - 2024/3/1

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

U2 - 10.1007/s12532-023-00249-1

DO - 10.1007/s12532-023-00249-1

M3 - Journal article

VL - 16

SP - 93

EP - 111

JO - Mathematical Programming Computation

JF - Mathematical Programming Computation

SN - 1867-2949

IS - 1

M1 - 1

ER -