Constraint Programming Tutorial

尽管约束编程(CP)在优化和建模中发挥着越来越重要的作用，但很少有美国大学提供该领域的培训。特别是，美国运筹学(OR)社区对合并OR和CP的好处认识有限，尽管现在有几个商业和非商业解算器可以做到这一点。因此，一个教程是为人工智能，特别是想要了解CP是什么的OR人设计的。它的前提是没有CP背景。该领域的顶尖人才将担任讲师。这笔助学金为希望参加辅导的博士生提供经济支持，并为教师参与提供适度的支持。CP教程于2009年5月27日至28日在卡内基梅隆大学泰珀商学院(http://web.tepper.cmu.edu/CPAIOR09).)举行，之后将于2009年5月29日至31日在卡内基梅隆大学泰珀商学院举行CPAIOR主要会议该教程代表了研究和教育的宝贵整合，该教程和会议可能会提高约束编程(CP)在美国的可见度。

Although Constraint Programming (CP) plays an increasingly important role in optimization and modeling, very few U.S. universities offer training in the field. In particular, there is limited awareness in the U.S. operations research (OR) community of the benefits of combining OR and CP, even though several commercial and non-commercial solvers now make it possible to do so. A tutorial is therefore designed for AI and particularly OR people who want to learn what CP is all about. It presupposes no background in CP. Top people in the field will serve as instructors. This grant provides financial support to PhD students who want to attend the tutorial, and provides modest support for instructor participation. The CP tutorial takes place on May 27-28, 2009 and precedes the main conference, CPAIOR on 29-31 May, 2009 at the Tepper School of Business, Carnegie Mellon University (http://web.tepper.cmu.edu/CPAIOR09). The tutorial represents a valuable integration of research and education, and the tutorial and conference are likely to increase the visibility of constraint programming (CP) in the United States.