Main navigation | Main content
HOME » PROGRAMS/ACTIVITIES » Annual Thematic ProgramPROGRAMS/ACTIVITIES
Annual Thematic Program »Postdoctoral Fellowships »Hot Topics and Special »Public Lectures »New Directions »PI Programs »Math Modeling »Seminars »Be an Organizer »Annual »Hot Topics »PI Summer »PI Conference »Applying to Participate »
Talk Abstract
Simulated Annealing for Discrete Optimization and Random Walk on a Weighted Graph
Simulated Annealing for Discrete Optimization and Random Walk on a Weighted Graph
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
|
|
|
|
|