Marcel Jackson receives funding from the Australian Research Council for a project involving the algebraic theory of constraint satisfaction problems. When you look at a train or university timetable ...

The field of school timetabling optimisation has witnessed significant advances as researchers grapple with NP-hard combinatorial challenges inherent in balancing numerous constraints. Traditionally, ...

The examination timetabling problem is a complex, multi-constraint, and combinatorial challenge faced by academic institutions throughout the world. Over recent years, advances in metaheuristic and ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...