Generalized benchmark generation for dynamic combinatorial problems.
Abdulnasser YounesPaul H. CalamaiOtman A. BasirPublished in: GECCO Workshops (2005)
Keyphrases
- hard combinatorial optimization problems
- combinatorial problems
- combinatorial optimization
- constraint programming
- metaheuristic
- graph coloring
- traveling salesman problem
- constraint satisfaction
- constraint satisfaction problems
- solving hard
- phase transition
- graph colouring
- global constraints
- branch and bound algorithm
- search strategies
- specific problems
- integer programming
- upper bound