A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring.
Faisal N. Abu-KhzamBachir M. ChahinePublished in: CoRR (2018)
Keyphrases
- greedy heuristic
- graph coloring
- np hard
- combinatorial problems
- job shop scheduling
- constraint satisfaction problems
- scheduling problem
- greedy algorithm
- np complete problems
- phase transition
- max sat
- knapsack problem
- optimal solution
- hyper heuristics
- constraint programming
- traveling salesman problem
- integer programming
- job shop scheduling problem
- genetic programming
- artificial neural networks
- lower bound
- neural network
- distributed breakout