The topic of this course is the "non-traditional" optimization technique Constraint Programming (CP) and hybrids of CP with approaches in OR. Heavy emphasis will be placed on similarities and differences between CP and mathematical programming including the unified framework of search, relaxation, and inference. The primary hybrid approaches will be based on constraint generation approaches including Logic-based Benders Decomposition and SAT Modulo Theory. This is an advanced graduate level course intended for research-stream students. MEng students are not admitted without special permission from the instructor. The course will be challenging. Students are expected to read material in preparation for each lecture and, in a few cases, view online lectures. An objective of this course is to impart skills necessary for an academic career such as paper writing, presentation skills, and writing peer reviews. The main evaluation will be a project where the student is expected to apply techniques discussed in the course to their own research interests: you should do something you weren’t already planning to do as part of your research. A goal of this course is that these projects will be publishable in a peer-reviewed forum.