Mathematical Programming

, Volume 47, Issue 1–3, pp 367–387 | Cite as

Facets of the clique partitioning polytope

  • M. Grötschel
  • Y. Wakabayashi


A subsetA of the edge set of a graphG = (V, E) is called a clique partitioning ofG is there is a partition of the node setV into disjoint setsW1,⋯,Wk such that eachW i induces a clique, i.e., a complete (but not necessarily maximal) subgraph ofG, and such thatA = ∪ i=1 k 1{uv|u, v ∈ W i ,u ≠ v}. Given weightsw e ∈ℝ for alle ∈ E, the clique partitioning problem is to find a clique partitioningA ofG such that ∑ e∈A w e is as small as possible. This problem—known to be
-hard, see Wakabayashi (1986)—comes up, for instance, in data analysis, and here, the underlying graphG is typically a complete graph. In this paper we study the clique partitioning polytope
of the complete graphK n , i.e.,
is the convex hull of the incidence vectors of the clique partitionings ofK n . We show that triangles, 2-chorded odd cycles, 2-chorded even wheels and other subgraphs ofK n induce facets of
. The theoretical results described here have been used to design an (empirically) efficient cutting plane algorithm with which large (real-world) instances of the clique partitioning problem could be solved. These computational results can be found in Grötschel and Wakabayashi (1989).

Key words

Polyhedral combinatorics clique partitioning data analysis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.P. Barthélemy and B. Monjardet, “The median procedure in cluster analysis and social choice theory,”Mathematical Social Sciences 1 (1981) 235–267.Google Scholar
  2. [2]
    J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (Macmillan, London, 1976).Google Scholar
  3. [3]
    M. Grötschel and Y. Wakabayashi, “A cutting plane algorithm for a clustering problem,”Mathematical Programming (Series B) 45 (1989) 59–96.Google Scholar
  4. [4]
    R.M. Karp and C.H. Papadimitriou, “On linear characterizations of combinatorial optimization problems,”SIAM Journal on Computing 11 (1982) 620–632.Google Scholar
  5. [5]
    J.F. Marcotorchino and P. Michaud, “Optimization in exploratory data analysis,”Proceedings of 5th International Symposium on Operations Research (Physica Verlag, Köln, 1981).Google Scholar
  6. [6]
    J.F. Marcotorchino and P. Michaud, “Heuristic approach to the similarity aggregation problem,”Methods of Operations Research 43 (1981) 395–404.Google Scholar
  7. [7]
    S. Régnier, “Sur quelques aspects mathématiques des problèmes de classification automatique,”International Computer Centre Bulletin (1965).Google Scholar
  8. [8]
    M. Schader and U. Tüshaus, “Ein Subgradientenverfahren zur Klassification qualitativer Daten,”Operations Research Spektrum 7 (1985) 1–5.Google Scholar
  9. [9]
    A. Schrijver,Theory of Linear and Integer Programming (Wiley, Chichester, 1986).Google Scholar
  10. [10]
    U. Tüshaus, “Aggregation binärer Relationen in der qualitativen Datenanalyse,” in:Mathematical Systems in Economics, Vol. 82 (Hain, Königstein, 1983).Google Scholar
  11. [11]
    Y. Wakabayashi, “Aggregation of binary relations: algorithmic and polyhedral investigations,” Ph.D. Thesis, Universität Augsburg (Augsburg, 1986).Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1990

Authors and Affiliations

  • M. Grötschel
    • 1
  • Y. Wakabayashi
    • 2
  1. 1.Institut für MathematikUniversität AugsburgAugsburgFR Germany
  2. 2.Instituto de Matemática e EsratísticaUniversidade de Sāo PauloSão PauloBrazil

Personalised recommendations