Login / Signup

More effective randomized search heuristics for graph coloring through dynamic optimization.

Jakob BossekFrank NeumannPan PengDirk Sudholt
Published in: GECCO (2020)
Keyphrases
  • dynamic optimization
  • graph coloring
  • search heuristics
  • constraint programming
  • combinatorial problems
  • tabu search
  • hyper heuristics
  • data mining
  • np hard
  • job shop scheduling
  • orders of magnitude
  • metaheuristic