Breaking Instance-Independent Symmetries In Exact Graph Coloring.

Arathi Ramani Igor L. Markov Karem A. Sakallah Fadi A. Aloul

Published in: J. Artif. Intell. Res. (2006)

Keyphrases

graph coloring
symmetry breaking
combinatorial problems
job shop scheduling
np complete problems
constraint satisfaction problems
phase transition
hyper heuristics
neural network
scheduling problem
constraint programming
max sat
dynamic programming
combinatorial optimization
bin packing