Deterministic partitioning strategy to parallelize the constraint programming search space.
Tarek MenouerBertrand Le CunPublished in: SpringSim (HPS) (2014)
Keyphrases
- constraint programming
- search space
- constraint satisfaction problems
- constraint propagation
- search strategies
- search strategy
- combinatorial problems
- constraint satisfaction
- integer programming
- search heuristics
- column generation
- global constraints
- hard and soft constraints
- symmetry breaking
- search algorithm
- arc consistency
- constraint solving
- np hard problems
- constraint logic programming
- heuristic search
- combinatorial search
- constraint optimization
- parallel algorithm
- constraint networks
- metaheuristic
- constraint solver
- finite domain
- backtrack search
- hill climbing
- propositional satisfiability
- branch and bound
- genetic algorithm
- constraint solvers
- objective function