An Incremental SAT-Based Approach to the Graph Colouring Problem.

Gael Glorian Jean-Marie Lagniez Valentin Montmirail Nicolas Szczepanski

Published in: CP (2019)

Keyphrases

graph colouring
bin packing
round robin
combinatorial problems
satisfiability problem
phase transition
tabu search
sat problem
sat solvers
incremental learning
load balancing
search algorithm
timetabling problem
search strategies
stochastic local search
propositional satisfiability
particle swarm optimization