ABSTRACT
Combinatorial optimization often needs a large amount of computation resource. This is particularly the case for NP-hard problems, for which no efficient algorithm is known. Parallel computers may supply this resource. However, it may be interesting to use those platforms in another way than to parallelize the computation of the objective function of the visited configurations.
