A relaxed approach to combinatorial problems in robustness and diagnostics.
Frank CritchleyMichaël SchynsGentiane HaesbroeckCécile FauconnierGuobing LuRichard A. AtkinsonDong Qian WangPublished in: Stat. Comput. (2010)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- constraint satisfaction
- traveling salesman problem
- metaheuristic
- combinatorial optimization
- solving hard
- phase transition
- graph coloring
- branch and bound algorithm
- optimal solution
- global constraints
- hard combinatorial optimization problems
- combinatorial search
- branch and bound
- quantified boolean formulae
- graph colouring
- sat encodings
- specific problems
- simulated annealing
- search space