This paper describes the Simulated Annealing algorithm and the physical analogy on which
it is based. Some significant theoretical results are presented before describing how the …

This paper presents a comprehensive review of simulated annealing (SA)-based
optimization algorithms. SA-based algorithms solve single and multiobjective optimization …

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial
optimization and neural computing | Guide books skip to main content ACM Digital Library home …

The goal of the research out of which this monograph grew, was to make annealing as much
as possible a general purpose optimization routine. At first glance this may seem a straight …

This paper surveys the application of simulated annealing (SA) to operations research (OR)
problems. It is concluded that SA has been applied to both traditional (like single machine …

Theoretical and computational aspects of simulated annealing Page 1 Theoretical and
computational aspects of simulated annealing Citation for published version (APA): van …

We survey important developments in the theory of covering radius during the period 1985–
1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear …

1. INTRODUCTION. In a popular game played regularly in many countries one tries to guess
the outcomes in a number of competitions or matches. By an outcome we here mean that the …

Consider the set V 3 n of all n-tuples x=(x 1,…, xn) with xi∈{0, 1, 2}. We are interested in σ n,
the minimal size of a subset W of V 3 n, such that for any element x∈ V 3 n there exists at …

This paper outlines an application of the theory of simulated annealing to molecular
matching problems. Three cooling schedules are examined: linear, exponential and …