Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu search (ITS) algorithm for solving this problem. The proposed algorithm incorporates tabu search, local search, and solution perturbation procedures. We report computational results on CPP instances of size up to 2000 vertices. Performance comparisons of ITS against state-of-the-art methods from the literature demonstrate the competitiveness of our approach.

No abstract

Today exchange of data among CAD systems becomes more important. As each CAD system has its own flavor to represent the same objects, exchange of data among them is full of issues. Most common problems are incomplete transfer of presentation information, associativity between representation and presentation, usage of annotation planes and text. They are analyzed in details and possible solutions are suggested as well.