In J. Gu and P.M. Pardalos, editors, Satisfiability problems, volume 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 711-724. American Mathematical Society, 1997.
| BibTeX |
Annotation: This paper adapts a basic node interchange scheme for solving the circuit partitioning problem and develops a clustering technique that uses GRASP to generate clusters of moderate sizes. The number of clusters is predetermined as a function of the number of partitions required. Initially, the heuristic reads the circuit description and resizes the blocks to be used by GRASP, which utilizes only the construction phase to generate the number of required clusters. The GRASP construction phase is followed by a post-processing stage, in which a simple dynamic hill climbing algorithm is used as local search to improve the initial solution generated.