Set Constraints for Local Search

Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive.

Project Reports, Final Year Projects for Students, Case Studies, Dissertation Ideas, Thesis Topics, Project Sample Downloads