CP-Lib: Benchmark Instances of the Clique Partitioning Problem
- The Clique Partitioning Problem is a fundamental and much-studied N P-hard combi- natorial 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.
| Author: | Michael M. Sørensen, Adam N. Letchford |
|---|---|
| DOI: | https://doi.org/10.1007/s12532-023-00249-1 |
| ISSN: | 1867-2949 |
| Parent Title (English): | Mathematical Programming Computation |
| Publisher: | Springer Science and Business Media LLC |
| Document Type: | Article |
| Language: | English |
| Year of Completion: | 2023 |
| Volume: | 16 |
| Issue: | 1 |
| Page Number: | 19 |
| First Page: | 93 |
| Last Page: | 111 |
| Mathematical Programming Computation : | MPC 2024 - Issue 1 |
