The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...