Aykut Ozsoy

Title:
Clique partitioning with size constraints

Abstract:
We consider the problem of partitioning the vertices of a complete
graph into subcliques whose sizes are bounded from above and from
below. This is an extension of the Cliqe Partitoning Problem. The
Clique Partitioning Problem can be solved efficiently by using the
triangle inequalities. But the constraints on the subclique sizes
make the problem we deal with much harder to solve. We analyze the
polyhedral structure of the problem and discuss the facetness of
some inequalities introduced for some related problems in the
literature.