Combined eigenvector Tabu search approach for circuit partitioning

Abstract

This paper describes the application of the Tabu Search heuristic to guide an efficient interchange algorithm to reduce the number of cut nets for k-partitions that are initially generated by a numerical eigenvector model. Results obtained indicate that the quality of solutions and running time of this method is superior to results obtained from random starting points.