ABSTRACT
In this chapter we will study a combinatorial optimization method: simulated annealing. Optimization problems which occur in technological applications can quickly become forbiddingly complex and require huge computation times because of the combinatorial explosion of the number of possible solutions. A simple example, the task assignment problem, will serve to illustrate some of these difficulties.
