Synopsis

Timetabling problems are often computationally intractable for problem sizes of practical interest. Recent methodology that combines integer and constraint programming approaches through techniques such as generating logical Benders' cuts can increase the size of solvable instance. I'll illustrate these approaches through problems in sports scheduling and course timetabling and discuss opportunities for expanding their applicability.

About the Speaker

Michael Trick is a Professor of Operations Research at the Tepper School of Business at Carnegie Mellon University. In 2007, he is visiting the University of Auckland as a Hood Fellow and as the OR Society of New Zealand's Visiting Lecturer. In 2002, he was President of INFORMS (the Institute for Operations Research and the Management Sciences) and he is currently a Vice-President of IFORS (International Federation of Operational Research Societies) and is on the Executive Committee of the Association for Constraint Programming. His research
interests are in computational integer and constraint programming. His consulting activity includes work with many sports leagues on scheduling issues, with the United States Postal Service on supply chain design, and with the Internal Revenue Service (US) on capital budgeting. He is a Fellow of INFORMS.