Mario P. Vecchi, Scott Kirkpatrick
IEEE TCADIS
Simulated annealing is a stochastic optimization procedure which is widely applicable and has been found effective in several problems arising in computeraided circuit design. This paper derives the method in the context of traditional optimization heuristics and presents experimental studies of its computational efficiency when applied to graph partitioning and traveling salesman problems. © 1984 Plenum Publishing Corporation.
Mario P. Vecchi, Scott Kirkpatrick
IEEE TCADIS
Jorge V. José, Leo P. Kadanoff, et al.
Physical Review B
Scott Kirkpatrick, Winfried W. Wilcke, et al.
Physica A: Statistical Mechanics and its Applications
A. Brooks Harris, Scott Kirkpatrick
Physical Review B