A graph coloring based parallel hill climber for large-scale NK-landscapes.
Bilel DerbelLorenzo CanonnePublished in: GECCO (2021)
Keyphrases
- graph coloring
- phase transition
- combinatorial problems
- job shop scheduling
- np complete problems
- max sat
- constraint satisfaction
- scheduling problem
- constraint satisfaction problems
- satisfiability problem
- randomly generated
- branch and bound algorithm
- np complete
- lower bound
- sat problem
- constraint programming
- hyper heuristics
- dynamic programming