Analysis of finite length annealing schedules
From MaRDI portal
DOI10.1007/BF01759050zbMATH Open0719.90094MaRDI QIDQ2640465FDOQ2640465
Authors: Philip N. Strenski, Scott Kirkpatrick
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Convergence and finite-time behavior of simulated annealing
- A comparison of simulated annealing cooling strategies
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Efficient simulated annealing on fractal energy landscapes
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Markov and semi-Markov decision processes (90C40) Mathematical programming (90C99)
Cites Work
Cited In (11)
- Local stationarity in small area estimation models
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Optimal parameters for search using a barrier tree Markov model
- Simulated annealing algorithm for optimal capital growth
- Revisiting simulated annealing: a component-based analysis
- A theoretical framework for simulated annealing
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Finite-Time Behavior of Slowly Cooled Annealing Chains
- Metaheuristics: A bibliography
- Optimised simulated annealing for Ising spin glasses
- A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization
Uses Software
This page was built for publication: Analysis of finite length annealing schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640465)