Parallel Tree Search for Combinatorial Problems: a Comparative Study between OpenMP and MPI, .
Michaël KrajeckiChristophe JailletAlain BuiPublished in: Stud. Inform. Univ. (2008)
Keyphrases
- combinatorial problems
- parallel tree search
- shared memory
- constraint programming
- parallel algorithm
- message passing
- parallel programming
- constraint satisfaction problems
- metaheuristic
- combinatorial optimization
- constraint satisfaction
- combinatorial search
- traveling salesman problem
- distributed memory
- parallel computing
- phase transition
- message passing interface
- branch and bound algorithm
- global constraints
- data parallelism
- parallel computation
- high performance computing
- ant colony optimization
- heuristic search
- simulated annealing
- general purpose
- optimal solution
- parallel processing
- optimization problems