Skip to main content
SpringerLink
Log in

Redundant constraints in the standard formulation for the clique partitioning problem

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The clique partitioning problem is among the most fundamental graph partitioning problems. Given a complete weighted undirected graph, we find a vertex-disjoint union of cliques so as to maximize the sum of the weights within the cliques. The problem is known to be NP-hard, and exact algorithms and heuristics have been developed so far. In 1989, Grötschel and Wakabayashi (Math Program 45:59–96, 1989) proposed an integer linear programming formulation for the problem. Although this formulation has been employed by many algorithms, it is prohibitive even for relatively small graphs because it contains numerous constraints called transitivity constraints. In this study, we theoretically derive a certain class of redundant constraints in the formulation. Furthermore, we show that the constraints in the derived class are also redundant in the linear programming relaxation of the formulation. By using our results, the number of constraints treated in exact algorithms and heuristics may be reduced. We confirmed that more than half of the transitivity constraints are redundant for some instances, and that computation times to find an optimal solution are shortened for most instances.

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
Fig. 2

References

  1. Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. Eur. Phys. J. B 66, 409–418 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Liberti, L., Perron, S.: Column generation algorithms for exact modularity maximization in networks. Phys. Rev. E 82, 046112 (2010)

    Article  Google Scholar 

  3. Blake, C.L., Merz, C.J.: UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences (1998). http://archive.ics.uci.edu/ml/. Accessed 17 Apr 2014

  4. 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  MATH  Google Scholar 

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

    Article  Google Scholar 

  6. Dinh, T.N., Thai, M.T.: Towards optimal community detection: From trees to general weighted networks, Internet Math. (accepted pending revision)

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Malakooti, B., Yang, Z.: Multiple criteria approach and generation of efficient alternatives for machine-part family formulation in group technology. IIE Trans. 34, 837–846 (2002)

    Google Scholar 

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

    Article  Google Scholar 

  12. Miyauchi, A., Miyamoto, Y.: Computing an upper bound of modularity. Eur. Phys. J. B 86, 302 (2013)

    Article  Google Scholar 

  13. 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  MATH  Google Scholar 

  14. 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  MATH  Google Scholar 

  15. Wakabayashi, Y.: Aggregation of binary relations: algorithmic and polyhedral investigations, Ph.D. Thesis, Universität Augsburg (1986)

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

    Article  MathSciNet  MATH  Google Scholar 

  17. 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  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to thank two anonymous referees for their valuable suggestions. The second author is supported by the Grant-in-Aid for JSPS Fellows.

Author information

Authors and Affiliations

  1. Graduate School of Decision Science and Technology, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo, 152-8552, Japan

    Atsushi Miyauchi & Noriyoshi Sukegawa

Authors
  1. Atsushi Miyauchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Noriyoshi Sukegawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Atsushi Miyauchi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Miyauchi, A., Sukegawa, N. Redundant constraints in the standard formulation for the clique partitioning problem. Optim Lett 9, 199–207 (2015). https://doi.org/10.1007/s11590-014-0754-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0754-6

Keywords

Search

Navigation