Many decision problems (logistics, production, space, etc.) aiming at an optimal use of resources can be formulated as constraint combinatorial optimization problems. Unfortunately, these problems are difficult to solve mainly for two reasons: 1) They require complex algorithms to design and develop; 2) Finding an optimal solution can be computationally intensive. Constraint Programming (CP) solvers allow you to address these problems. Recently three well-known CP experts developed “MiniCP“, a light-weight CP Solver implemented in Java. You may freely download it and enroll in the training course. Link