Skip to main content
SpringerLink
Log in

CP-Lib: Benchmark Instances of the Clique Partitioning Problem

  • Full Length Paper
  • Published:
Mathematical Programming Computation Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Data and code availability

All datasets presented are available in the GitHub repository at https://github.com/MMSorensen/CP-Lib. The full code was made available for review. We plan to make the code available to the public after further development.

References

  1. Ali, H.H., El-Rewini, H.: Task allocation in distributed systems: a split graph model. J. Combin. Math. Combin. Comput. 14, 15–32 (1993)

    MathSciNet  Google Scholar 

  2. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89–113 (2004)

    Article  MathSciNet  Google Scholar 

  3. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069–1072 (1990)

    Article  Google Scholar 

  4. Böcker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60, 316–334 (2011)

    Article  MathSciNet  Google Scholar 

  5. Boctor, F.: A linear formulation of the machine-part cell formation problem. Int. J. Prod. Res. 29, 343–356 (1991)

    Article  Google Scholar 

  6. Boe, W.J., Cheng, C.H.: A close neighbour algorithm for designing cellular manufacturing systems. Int. J. Prod. Res. 29, 2097–2116 (1991)

    Article  Google Scholar 

  7. Brimberg, J., Janićijević, S., Mladenović, N.: Solving the clique partitioning problem as a maximally diverse grouping problem. Optim. Lett. 11, 1123–1135 (2017)

    Article  MathSciNet  Google Scholar 

  8. Bruckner, S., Hüffner, F., Komusiewicz, Ch., Niedermeier, R.: Evaluation of ILP-based approaches for partitioning into colorful components. In: Bonifaci, V., et al. (eds.) Exp. Algorithms, pp. 176–187. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Brunetta, L., Conforti, M., Rinaldi, G.: A branch-and-cut algorithm for the equicut problem. Math. Program. 77, 243–263 (1997)

    Article  MathSciNet  Google Scholar 

  10. Brusco, M.J., Köhn, H.F.: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem. Psychometrika 74, 685–703 (2009)

    Article  MathSciNet  Google Scholar 

  11. Burbidge, J.L.: Production flow analysis for planning group technology. J. Oper. Manag. 10, 5–27 (1991)

    Article  Google Scholar 

  12. Cantamessa, M., Turroni, A.: A pragmatic approach to machine and part grouping in cellular manufacturing system design. Int. J. Prod. Res. 35, 1031–1050 (1997)

    Article  Google Scholar 

  13. Chan, H.M., Milner, D.A.: Direct clustering algorithm for group formation in cellular manufacturing. J. Manuf. Syst. 1, 65–74 (1982)

    Article  Google Scholar 

  14. Chandrasekharan, M.P., Rajagopalan, R.: MODROC: an extension of rank order clustering for group technology. Int. J. Prod. Res. 24, 1221–1233 (1986)

    Article  Google Scholar 

  15. Chandrasekharan, M.P., Rajagopalan, R.: ZODIAC – an algorithm for concurrent formation of part-families and machine-cells. Int. J. Prod. Res. 25, 835–850 (1987)

    Article  Google Scholar 

  16. Charon, I., Hudry, O.: Noising methods for a clique partitioning problem. Discr. Appl. Math. 15, 754–769 (2006)

    Article  MathSciNet  Google Scholar 

  17. Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59, 87–115 (1993)

    Article  MathSciNet  Google Scholar 

  18. Conforti, M., Rao, M.R., Sassano, A.: The equipartition polytope I: formulations, dimension and basic facets. Math. Program. 49, 49–70 (1990)

    Article  MathSciNet  Google Scholar 

  19. De Amorim, S.G., Barthélemy, L.-P., Riberio, C.C.: Clustering and clique partitioning: simulated annealing and tabu search approaches. J. Classif. 9, 17–41 (1992)

    Article  MathSciNet  Google Scholar 

  20. Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang,Y.: The cluster editing problem: implementations and experiments. In H.L. Bodlaender & M.A. Langston (eds) Proc. IWPEC ’06. Springer, Berlin (2006)

  21. Deza, M., Grötschel, M., Laurent, M.: Clique-web facets for multicut polytopes. Math. Oper. Res. 17, 981–1000 (1992)

    Article  MathSciNet  Google Scholar 

  22. Dorndorf, U., Jaehn, F., Pesch, E.: Modeling robust flight-gate scheduling as a clique partitioning problem. Transp. Sci. 42, 292–301 (2008)

    Article  Google Scholar 

  23. Dorndorf, U., Pesch, E.: Fast clustering algorithms. ORSA J. Comput. 6, 141–153 (1994)

    Article  Google Scholar 

  24. Du, Y., Kochenberger, G., Glover, F., Wang, H., Lewis, M., Xie, W., Tsuyuguchi, T.: Solving clique partitioning problems: a comparison of models and commercial solvers. Int. J. Inf. Technol. Decis. Mak. 21, 59–81 (2022)

    Article  Google Scholar 

  25. Dua, D., Graff, C.: UCI machine learning repository http://archive.ics.uci.edu/ml/. Irvine, CA: University of California, School of Information and Computer Science (2019)

  26. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  ADS  MathSciNet  Google Scholar 

  27. Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45, 59–96 (1989)

    Article  MathSciNet  Google Scholar 

  28. Jaehn, F., Pesch, E.: New bounds and constraint propagation techniques for the clique partitioning problem. Discr. Appl. Math. 161, 2025–2037 (2013)

    Article  MathSciNet  Google Scholar 

  29. Jovanovic, R., Sanfilippo, A.P., Voß, S.: Fixed set search applied to the clique partitioning problem. Eur. J. Oper. Res. 309, 65–81 (2023)

    Article  MathSciNet  Google Scholar 

  30. Kattan, I.A.: Design and scheduling of hybrid multi-cell flexible manufacturing systems. Int. J. Prod. Res. 35, 1239–1257 (1997)

    Article  Google Scholar 

  31. King, J.R.: Machine component group formation in group technology. Omega 8, 193–199 (1980)

    Article  Google Scholar 

  32. King, J.R.: Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm. Int. J. Prod. Res. 18, 213–232 (1980)

    Article  ADS  Google Scholar 

  33. King, J.R., Nakornchai, V.: Machine-component group formation in group technology: review and extension. Int. J. Prod. Res. 20, 117–133 (1982)

    Article  Google Scholar 

  34. Kochenberger, G., Glover, F., Alidaee, B., Wang, H.: Clustering of microarray data via clique partitioning. J. Comb. Optim. 10, 77–92 (2005)

    Article  MathSciNet  Google Scholar 

  35. Kumar, K.R., Kusiak, A., Vannelli, A.: Grouping of parts and components in flexible manufacturing systems. Eur. J. Oper. Res. 24, 387–397 (1986)

    Article  Google Scholar 

  36. Lorena, L.H.N., Quiles, M.G., Lorena, L.A.N., de Carvalho, A.C.P.L.F., Cespedes, J.G.: Qualitative data clustering: a new integer linear programming model, Proc. IJCNN ’19. IEEE, Piscataway, NJ (2019)

  37. Lu, Z., Zhou, Y., Hao, J.-K.: A hybrid evolutionary algorithm for the clique partitioning problem. IEEE Trans. Cyber. 52, 9391–9403 (2022)

    Article  Google Scholar 

  38. Marcotorchino, J.F.: Aggregation of similarities in automatic classification (in French). Doctoral Thesis, Université Paris VI (1981)

  39. Masnata, A., Settineri, L.: An application of fuzzy clustering to cellular manufacturing. Int. J. Prod. Res. 35, 1077–1094 (1997)

    Article  Google Scholar 

  40. McCormick, W.T., Jr., Schweitzer, P.J., White, T.W.: Problem decomposition and data reorganization by a clustering technique. Oper. Res. 20, 993–1009 (1972)

    Article  Google Scholar 

  41. Miltenburg, J., Zhang, W.: A comparative evaluation of nine well-known algorithms for solving the cell formation problem in group technology. J. Oper. Manag. 10, 44–72 (1991)

    Article  Google Scholar 

  42. Nair, G.J.K., Narendran, T.T.: Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group technology. Int. J. Prod. Res. 34, 2767–2782 (1996)

    Article  Google Scholar 

  43. Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: facets and patching facets. Networks 38, 209–226 (2001)

    Article  MathSciNet  Google Scholar 

  44. Palubekis, G.: A branch-and-bound approach using polyhedral results for a clustering problem. INFORMS J. Comput. 9, 30–42 (1997)

    Article  MathSciNet  Google Scholar 

  45. Palubeckis, G., Ostreika, A., Tomkevičius, A.: An iterated tabu search approach for the clique partitioning problem, Sci. World J., article 353101 (2014)

  46. Rogers, D.F., Kulkarni, S.S.: Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing. Eur. J. Oper. Res. 160, 423–444 (2005)

    Article  Google Scholar 

  47. Schader, M., Tüshaus, U.: A subgradient algorithm for classification of qualitative data (in German). OR Spektrum 7, 1–5 (1985)

    Article  Google Scholar 

  48. Seifoddini, H.: Machine grouping – expert systems: comparison between single linkage and average linkage clustering techniques in forming machine cells. Comput. Indust. Eng. 15, 210–216 (1988)

    Article  Google Scholar 

  49. Simanchev, R.Y., Urazova, I.V., Kochetov, Y.A.: The branch and cut method for the clique partitioning problem. J. Appl. Ind. Math. 13, 539–556 (2019)

    Article  MathSciNet  Google Scholar 

  50. Sørensen, M.M.: A separation heuristic for 2-partition inequalities for the clique partitioning problem, Working paper, Department of Economics and Business Economics, Aarhus University (2020)

  51. Sukegawa, N., Yamamoto, Y., Zhang, L.: Lagrangian relaxation and pegging test for the clique partitioning problem. Adv. Data Anal. Classif. 7, 363–391 (2013)

    Article  MathSciNet  Google Scholar 

  52. Sule, D.R.: Machine capacity planning in group technology. Int. J. Prod. Res. 29, 1909–1922 (1991)

    Article  Google Scholar 

  53. Wakabayashi, Y.: Aggregation of binary relations: algorithmic and polyhedral investigations. PhD Thesis, Augsburg University (1986)

  54. Wang, H., Alidaee, B., Glover, F., Kochenberger, G.: Solving group technology problems via clique partitioning. Int. J. Flex. Manuf. Syst. 18, 77–97 (2006)

    Article  Google Scholar 

  55. Zhou, Y., Hao, J.-K., Goëffon, A.: A three-phased local search approach for the clique partitioning problem. J. Combin. Optim. 32, 469–491 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Funding

The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.

Author information

Authors and Affiliations

  1. Department of Economics and Business Economics, Aarhus University, Fuglesangs Allé 4, 8210, Aarhus V, Denmark

    Michael M. Sørensen

  2. Department of Management Science, Lancaster University, Bailrigg Campus, Lancaster LA1 4YX, UK

    Adam N. Letchford

Authors
  1. Michael M. Sørensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam N. Letchford
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael M. Sørensen.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest, financial or otherwise.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sørensen, M.M., Letchford, A.N. CP-Lib: Benchmark Instances of the Clique Partitioning Problem. Math. Prog. Comp. 16, 93–111 (2024). https://doi.org/10.1007/s12532-023-00249-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12532-023-00249-1

Keywords

Mathematics Subject Classification

Search

Navigation