Convergence of an annealing algorithm
type: Item
instance of: scholarly article
title: Convergence of an annealing algorithm
zbMATH Open document ID: 0581.90061
DOI: 10.1007/BF01582166
published in: Mathematical Programming
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3930724
zbMATH Keywords: global optimization
zbMATH Keywords: metropolis method
zbMATH Keywords: hill climbing
zbMATH Keywords: local improvement
zbMATH Keywords: annealing algorithm
zbMATH Keywords: stochastic optimization
zbMATH Keywords: NP-hard combinatorial problems
zbMATH Keywords: travelling salesman
zbMATH Keywords: Steiner trees
zbMATH Keywords: convergence rate
MaRDI profile type: Publication
cites work: Q3943082
cites work: Q4745163
cites work: Q4198056
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Q3970132
cites work: Q3855869
cites work: Optimization by Simulated Annealing
cites work: Non-negative matrices and Markov chains. 2nd ed
cites work: Q5657944
cites work: On the number of iterations of local improvement algorithms
description: scientific article