Solving the Latin Square Completion Problem by Memetic Graph Coloring.
Yan JinJin-Kao HaoPublished in: IEEE Trans. Evol. Comput. (2019)
Keyphrases
- graph coloring
- np complete problems
- combinatorial problems
- job shop scheduling
- phase transition
- constraint satisfaction problems
- scheduling problem
- examination timetabling
- max sat
- hyper heuristics
- artificial bee colony
- combinatorial optimization
- differential evolution
- metaheuristic
- memetic algorithm
- min max
- sat encodings
- distributed constraint optimization problems
- distributed sensor networks
- job shop scheduling problem
- constraint programming
- heuristic search