March 5th & 12th, 2013

As a part of mini-lectures series, Professor Beck will be holding two one-hour lectures on constraints programming.


When: Lecture 1 on Tuesday March 5, 2013 @ 12:00-1:00pm
Lecture 2 on Tuesday March 12, 2013 @ 12:00-1:00pm
Where: Classroom MC310, Mechanical Engineering, University of Toronto

 

Abstract:
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 number of advanced examples that either compare or hybridize 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?

 

Biosketch:
Chris Beck is an Associate Professor and Associate Chair, Research in the Department of Mechanical & Industrial Engineering, University of Toronto. Chris' MSc and PhD degrees both come for the Department of Computer Science, University of Toronto, in the area of Artificial Intelligence. Chris then spent three years at ILOG, Paris as a Senior Scientist and Software Engineer on the team responsible for their constraint-based scheduling library (ILOG Scheduler) before spending two years at the as a Staff Scientist at the Cork Constraint Computation Centre. He returned to Toronto in 2004 to join the Department of Mechanical & Industrial Engineering.

Chris' research interests include scheduling, constraint programming, AI planning, reasoning under uncertainty, queueing theory, mixed integer programming, and hybrid optimization techniques. Chris currently serves in an editorial capacity for four journals and one website in AI and OR. He is the President-Elect of the Executive Council for the International Conference on Automated Planning and Scheduling.

 

Snacks and refreshments will be provided