Solving Scheduling Problems as the Puzzle Games Using Constraint Programming

Provided by: Academy & Industry Research Collaboration Center
Topic: Software
Format: PDF
Constraint Programming (CP) is one of the most effective techniques for solving practical operational problems. The outstanding feature of the method is a set of constraints affecting a solution of a problem can be imposed without a need to explicitly defining a linear relation among variables, i.e. an equation. Nevertheless, the challenge of paramount importance in using this technique is how to present the operational problem in a solvable Constraint Satisfaction Problem (CSP) model. The problem modeling is problem independent and could be an exhaustive task at the beginning stage of problem solving, particularly when the problem is a real-world practical problem.

Find By Topic