论文信息 - Stochastic versus deterministic update in simulated annealing - 字舞流文

Stochastic versus deterministic update in simulated annealing

J. Fontanari | P. Moscato

[1] Stefano Patarnello,et al. Learning Networks of Neurons with Boolean Logic , 1987 .

[2] I. Morgenstern,et al. Heidelberg Colloquium on Glassy Dynamics , 1987 .

[3] N-city traveling salesman problem: Optimization by simulated annealings , 1986 .

[4] Geoffrey E. Hinton,et al. Learning symmetry groups with hidden units: beyond the perceptron , 1986 .

[5] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[7] Gary S. Grest,et al. Irreversibility and metastability in spin-glasses. I. Ising model , 1983 .

[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[9] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[10] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[11] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.