PARALLEL META-HEURISTICS APPLICATIONS problems, set covering and partitioning, satisfiability and max-sat problems, quadratic assignment, location and network design, traveling salesman and vehicle routing problems. We do not pretend to be exhaustive. We have also restricted to a minimum the presentation of general parallel computation issues as well as that of the parallel meta-heuristic strategies. The reader may consult a number of surveys, taxonomies, and syntheses of parallel meta-heuristics, of which quite a few address the "classical" meta-heuristics, Simulated Annealing, Genetic Algorithms, and Tabu Search, while some others address the field in more comprehensive terms: