Adaptive N to P Portfolio for Solving Constraint Programming Problems on Top of the Parallel Bobpp Framework.
Tarek MenouerBertrand Le CunPublished in: IPDPS Workshops (2014)
Keyphrases
- constraint programming
- combinatorial problems
- finite domain
- search heuristics
- constraint problems
- np hard problems
- constraint solvers
- constraint satisfaction problems
- constraint propagation
- constraint satisfaction
- constraint optimization
- graph coloring
- solving hard
- np complete
- constraint solving
- optimization problems
- search strategies
- combinatorial search
- integer programming
- combinatorial optimization
- symmetry breaking
- propositional satisfiability
- global constraints
- column generation
- np hard
- search algorithm