Controlling iterated jumps of solutions to combinatorial problems.
Ludovic PateyPublished in: Comput. (2017)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- constraint satisfaction problems
- traveling salesman problem
- graph coloring
- constraint satisfaction
- phase transition
- combinatorial optimization
- combinatorial search
- solving hard
- branch and bound algorithm
- markov chain
- graph colouring
- global constraints
- hard combinatorial optimization problems
- constraint propagation
- randomly generated
- ant colony optimization
- scheduling problem
- boolean satisfiability
- sat encodings
- lower bound
- genetic algorithm