Solve the problem

The third stage in solving a constraint programming problem with CP Optimizer is to search for a solution and solve the problem.

Solution
A solution to a constraint programming problem is a set of value assignments to the constrained variables.
Search space
The search space of a constraint programming problem is all combinations of the values in the domains of the decision variables.
Initial constraint propagation
Constraint propagation is a powerful technique used by CP Optimizer in the search for solutions to constraint programming problems. The initial constraint propagation removes values from domains that will not take part in any solution.
Constructive search
Along with constraint propagation, constructive search strategies are used by CP Optimizer in the search for solutions to constraint programming problems.
Constraint propagation during search
Constraint propagation is combined with a constructive search strategy is used by CP Optimizer in the search for solutions to constraint programming problems.

Parent topic: Constraint programming with CP Optimizer