Simulated Annealing for Discrete Optimization and Random Walk on a Weighted Graph

Monday, May 12, 1997 - 11:00am - 12:00pm
Vincent 570
Guoliang Xue (University of Vermont)
Simulated annealing (SA) has been used to produce good solutions to many discrete optimization problems. However, little is known why SA works so well on so many problems. In this paper, we relate SA to random walk and investigate some of the properties of SA.