Efficient simulated annealing on fractal energy landscapes
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (1-6), 367-418
- https://doi.org/10.1007/bf01759051
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- Conductance and convergence of Markov chains-a combinatorial treatment of expandersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolvedPublished by Association for Computing Machinery (ACM) ,1988
- Polytopes, permanents and graphs with large factorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- Convergence of an annealing algorithmMathematical Programming, 1986
- Configuration space analysis of travelling salesman problemsJournal de Physique, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Optimization by Simulated AnnealingScience, 1983