Some Uses of Dilators in Combinatorial Problems, II.
V. Michele AbrusciJean-Yves GirardJacques Van de WielePublished in: J. Symb. Log. (1990)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- combinatorial optimization
- constraint satisfaction problems
- graph coloring
- traveling salesman problem
- constraint satisfaction
- solving hard
- phase transition
- combinatorial search
- graph colouring
- global constraints
- branch and bound algorithm
- optimization problems
- hard combinatorial optimization problems
- tabu search
- optimal solution
- reinforcement learning
- specific problems
- simulated annealing
- search space