Partitioning Optimization by Recursive Moves of Hierarchically Built Clusters

The paper presents a general approach for partitioning optimization based on the hierarchical clustering by the optimal circuit reduction (OCR) method. This method has proved to be robust, effective and efficient tool to identify the hierarchical clusters circuit structure. For initial partitioning and its optimization the optimal circuit reduction trees are used. Recursive moves (transfers and exchanges) of hierarchically built clusters and their groups of arbitrary sizes are performed for optimization. Some new efficient procedures to escape from the local optima are suggested.