Many-Core Approaches to Combinatorial Problems: case of the Langford Problem.
Michaël KrajeckiJulien LoiseauFrançois AlinChristophe JailletPublished in: Supercomput. Front. Innov. (2016)
Keyphrases
- combinatorial problems
- constraint satisfaction problems
- constraint programming
- constraint satisfaction
- constraint propagation
- metaheuristic
- phase transition
- graph coloring
- combinatorial optimization
- global constraints
- combinatorial search
- neural network
- special case
- traveling salesman problem
- branch and bound algorithm
- specific problems