Abstract
Tabu Search is a simple combinatorial optimization strategy that has been applied in graph coloring, scheduling, and space planning. The application of the Tabu Search heuristic to the circuit partitioning problem is described. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than the best netlist partitions obtained by using an interchange method or simulated annealing. The Tabu Search method is 3 to 20 times faster than simulated annealing on tested problems. The benefit of integrating Tabu Search with simulated annealing is discussed. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
