HOME    »    PROGRAMS/ACTIVITIES    »    Annual Thematic Program
Talk Abstract
Simulated Annealing for Discrete Optimization and Random Walk on a Weighted Graph

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.

Back to Workshop Schedule

1996-1997 Mathematics in High Performance Computing

Connect With Us: