The effect of the density of states on the Metropolis algorithm

Information Processing Letters - Tập 37 - Trang 159-163 - 1991
Galen Sasaki1
1Department of Electrical and Computer Engineering, University of Texas, Austin, TX 78712-1084, USA

Tài liệu tham khảo

Černy, 1985, A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Optim. Theory Appl., 45, 41, 10.1007/BF00940812 Hajek, 1988, Cooling schedules for optimal annealing, Math. Oper. Res., 13, 311, 10.1287/moor.13.2.311 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 621, 10.1126/science.220.4598.671 Metropolis, 1953, Equation of state calculations by fast computer machines, J. Chem. Phys., 21, 1087, 10.1063/1.1699114 Sasaki, 1987, Optimization by simulated annealing: a time complexity analysis Sasaki, 1988, The time complexity of maximum matching by simulated annealing, J. ACM, 35, 87, 10.1145/42282.46160