The Community for Technology Leaders
Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
ISBN: 0-8186-0864-1
pp: 306-311
Lam , Yale Univ., New Haven, CT, USA
Delosme , Yale Univ., New Haven, CT, USA
ABSTRACT
A simulated annealing schedule is derived. Its application to the standard cell placement and the traveling salesman problems results in a two to twenty-four times speedup over annealing schedules currently available in the literature. Since it uses only statistical quantities, the annealing schedule is applicable to general combinatorial optimization problems.
INDEX TERMS
integrated circuit layout, simulated annealing schedule, standard cell placement, traveling salesman problems, statistical quantities, combinatorial optimization problems
CITATION

Lam and Delosme, "Performance of a new annealing schedule," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 306-311.
doi:10.1109/DAC.1988.14775
95 ms
(Ver 3.3 (11022016))