An experimental evaluation of upper bounds of clique weights based on graph coloring.
Yuki KashiharaKazuaki YamaguchiMasahide NakamuraPublished in: BCD (2023)
Keyphrases
- graph coloring
- upper bound
- experimental evaluation
- combinatorial problems
- lower bound
- job shop scheduling
- max sat
- branch and bound algorithm
- np complete problems
- phase transition
- scheduling problem
- branch and bound
- constraint satisfaction problems
- worst case
- constraint satisfaction
- artificial bee colony
- hyper heuristics
- constraint programming
- search tree
- genetic algorithm
- metaheuristic
- objective function
- reinforcement learning