The effect of the density of states on the Metropolis algorithm

DOI10.1016/0020-0190(91)90037-IzbMath0713.68027OpenAlexW2090726598MaRDI QIDQ750154

Galen Sasaki

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90037-i

zbMATH Keywords

simulated annealingperformance evaluationMarkov chainrandom local search

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical optimization and variational techniques (65K10) Parallel algorithms in computer science (68W10) Mathematical programming (90C99)

Related Items (2)

The Metropolis algorithm for graph bisection ⋮ Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Cooling Schedules for Optimal Annealing
• The time complexity of maximum matching by simulated annealing
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: The effect of the density of states on the Metropolis algorithm