A combined eigenvector tabu search approach for circuit partitioning
| Author(s) : | Anthony Vannelli Shawki Areibi, |
| Publisher : | N/A |
| Publication Date : | 1993 |
| ISSN : | N/A |
| Abstract : | This paper describes the application of the Tabu Search [1] heuristic to guide an efficient interchange algorithm to reduce the number of cut nets for kpartitions 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. 1, |