Tutorial CISCHED-T constraint-based scheduling

Roman Barták · 2009

Constraint satisfaction is a successful technology dealing with real-life combinatorial optimisation problems. This tutorial gives a brief introduction to constraint satisfaction techniques in general - the mainstream search and inference algorithms are presented.

Read the paper · More papers on PaperTik