Breaking Instance-Independent Symmetries in Exact Graph Coloring.
Arathi RamaniFadi A. AloulIgor L. MarkovKarem A. SakallahPublished in: DATE (2004)
Keyphrases
- graph coloring
- symmetry breaking
- combinatorial problems
- phase transition
- job shop scheduling
- np complete problems
- constraint satisfaction problems
- constraint programming
- scheduling problem
- hyper heuristics
- max sat
- np complete
- global constraints
- traveling salesman problem
- evolutionary algorithm
- neural network
- artificial bee colony
- metaheuristic
- computational intelligence
- upper bound
- multi objective