Michael M. Sørensen, Adam N. Letchford, “CP-Lib: Benchmark Instances of the Clique Partitioning Problem”, Math. Prog. Comp., 16, no. 1, 2024, 93
Adam N. Letchford, Anh N. Vu, “Facets from gadgets”, Math. Program., 185, no. 1-2, 2021, 297
Zacharie Ales, Arnaud Knippel, “The K‐partitioning problem: Formulations and branch‐and‐cut”, Networks, 76, no. 3, 2020, 323
Rudolf Müller, Andreas S. Schulz, “Transitive Packing: A Unifying Concept in Combinatorial Optimization”, SIAM J. Optim., 13, no. 2, 2002, 335
Sungwoong Kim, Chang D. Yoo, Sebastian Nowozin, Pushmeet Kohli, “Image Segmentation UsingHigher-Order Correlation Clustering”, IEEE Trans. Pattern Anal. Mach. Intell., 36, no. 9, 2014, 1761
Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma, “The clique partitioning problem: Facets and patching facets”, Networks, 38, no. 4, 2001, 209
Zacharie Ales, Arnaud Knippel, “An extended edge-representative formulation for the K-partitioning problem”, Electronic Notes in Discrete Mathematics, 52, 2016, 333
Sunil Chopra, M.R. Rao, “Facets of the k-partition polytope”, Discrete Applied Mathematics, 61, no. 1, 1995, 27
Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2013, 131
Michel Deza, Monique Laurent, “The even and odd cut polytopes”, Discrete Mathematics, 119, no. 1-3, 1993, 49