Strategies for a Massively Parallel Implementation of Simulated Annealing

Massively parallel implementations of simulated annealing algorithms to solve NP-complete combinatorial problems are discussed. All solutions are based upon the processor farm model, where each worker tries a distinct rearrangement to improve the current solution.