A survey of large time asymptotics of simulated annealing algorithms
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] Marcel Coderch i Collell. Multiple time scale approach to heirarchical aggregation of linear systems and finite state Markov processes , 1982 .
[3] S. Sastry,et al. Hierarchical aggregation of singularly perturbed finite state Markov processes , 1983 .
[4] F. Delebecque. A Reduction Process for Perturbed Markov Chains , 1983 .
[5] Scott Kirkpatrick,et al. Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[7] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .
[9] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.
[10] B. Gidas. Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .
[11] Sanjoy Mitter,et al. Analysis of simulated annealing for optimization , 1985, 1985 24th IEEE Conference on Decision and Control.
[12] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[13] B. Gidas. Global optimization via the Langevin equation , 1985, 1985 24th IEEE Conference on Decision and Control.
[14] B. Cabane,et al. Anisotropy of a flexible polymeric chain in a nematic field : neutron scattering versus magnetic resonance , 1985 .
[15] S. Kirkpatrick,et al. Configuration space analysis of travelling salesman problems , 1985 .
[16] Alan S. Willsky,et al. The reduction of perturbed Markov generators: an algorithm exposing the role of transient states , 1988, JACM.
[17] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[18] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[19] John N. Tsitsiklis,et al. Markov Chains with Rare Transitions and Simulated Annealing , 1989, Math. Oper. Res..