# Research Interests

I am interested in solving difficult combinatorial problems, such as those in transportation, scheduling, and bioinformatics. I have done research in detecting and exploiting symmetry in constraint programming to make solving these problems easier, and my current work is in finding other ways of making constraint solving faster with caching and problem re-modeling.

See previous student projects.

# Experimental Data

## Symmetry breaking

In our research we have used certain benchmark problems to test our *Lightweight Dynamic Symmetry Breaking* method. The benchmark problems work with ECLiPSe and Gecode, and can be found here.