Analysis of finite length annealing schedules

DOI10.1007/BF01759050zbMath0719.90094MaRDI QIDQ2640465

Scott Kirkpatrick, Philip N. Strenski

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

simulated annealingpartitioning a highly symmetric weighted graph

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items (9)

A theoretical framework for simulated annealing ⋮ Metaheuristics: A bibliography ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Optimal parameters for search using a barrier tree Markov model ⋮ A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization ⋮ An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem ⋮ Simulated annealing algorithm for optimal capital growth ⋮ Best-so-far vs. where-you-are: Implications for optimal finite-time annealing ⋮ Local stationarity in small area estimation models

Uses Software

• HSL
• TimberWolf

Cites Work

• Optimization by Simulated Annealing
• Configuration Space Analysis for Optimization Problems
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

This page was built for publication: Analysis of finite length annealing schedules