Title: Everything You Wanted to Know about Constraint Programming But Were Afraid to Ask

Constraint Programming (CP) is a commercially successful approach to solving hard combinatorial optimization problems such as scheduling. This talk will look in-depth at the core pieces of constraint programming (modeling, heuristic search, propagation/inference, and backtracking), note key differences between CP and traditional mathematical programming, and present a some recent work combining CP with other mathematical programming techniques.

The goal of this talk is to answer the question: What is Constraint Programming and why should I care?