Simulated annealing is a stochastic optimization procedure which is widely applicable and has been found effective in several problems arising in computer-aided 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.