A Note on the Finite Time Behavior of Simulated Annealing
From MaRDI portal
Publication:2757648
DOI10.1287/moor.25.3.476.12211zbMath1073.90579OpenAlexW2116677144MaRDI QIDQ2757648
Andreas Nolte, Rainer Schrader
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fb1b07a7a42723d317c9513474ff24c757b793c8
simulated annealingtraveling salesman problemconductancerapidly mixing Markov chainsfinite time bounds
Approximation methods and heuristics in mathematical programming (90C59) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (7)
Improved bounds for the large-time behaviour of simulated annealing ⋮ Evolutionary optimization: pitfalls and booby traps ⋮ Sparse regression with exact clustering ⋮ A simulated annealing algorithm for transient optimization in gas networks ⋮ A dynamic programming approach to efficient sampling from Boltzmann distributions ⋮ Analysis of static simulated annealing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms
This page was built for publication: A Note on the Finite Time Behavior of Simulated Annealing
