{"id":185000,"date":"2009-12-01T00:00:00","date_gmt":"2010-08-05T14:57:40","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/general-principles-of-constraint-programming\/"},"modified":"2016-09-09T09:55:45","modified_gmt":"2016-09-09T16:55:45","slug":"general-principles-of-constraint-programming","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/general-principles-of-constraint-programming\/","title":{"rendered":"General Principles of Constraint Programming"},"content":{"rendered":"<div class=\"asset-content\">\n<p>Constraint programming (CP) is a general and powerful method to solve some<br \/>\ncombinatorial problems. This method has been successfully used to solve a large range of real-life applications<br \/>\n(rostering, time-tabling, car manufacturing, scheduling etc&#8230;), which can be quite different.<\/p>\n<p>CP is on the borderline of AI and OR.<br \/>\nCP inherits from IA the language aspect (that is the easy way to define a problem), the flexibility<br \/>\n(that is the fact that problems can be easily modified) and the possibility to benefit from the knowledge<br \/>\nof the application domain to improve the resolution of a problem. Operational Research brings to CP a lot of nice and<br \/>\npowerful algorithms which gives to CP the computational aspect needed to solve some real world problems.<\/p>\n<p>In this talk we will introduce the general principles of this method. We will<br \/>\ninsist on its originality and on its flexibility. We will show its strength and its weakness.<br \/>\nNotably, we will detail how some OR algorithms are used and why no restriction is made on the type<br \/>\nof constraints that can be considered. We will also compare CP to several other approaches<br \/>\n(like MIP, Greedy Algorithm, Local Search etc&#8230;) and explain how all these methods<br \/>\nare often combined thanks to CP in order to solve real world applications. Some computational results will be given.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Constraint programming (CP) is a general and powerful method to solve some combinatorial problems. This method has been successfully used to solve a large range of real-life applications (rostering, time-tabling, car manufacturing, scheduling etc&#8230;), which can be quite different. CP is on the borderline of AI and OR. CP inherits from IA the language aspect [&hellip;]<\/p>\n","protected":false},"featured_media":290267,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_hide_image_in_river":0,"footnotes":""},"research-area":[],"msr-video-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-session-type":[],"msr-impact-theme":[],"msr-pillar":[],"msr-episode":[],"msr-research-theme":[],"class_list":["post-185000","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/pHsw7lju_io","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/185000","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/185000\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/290267"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=185000"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=185000"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=185000"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=185000"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=185000"},{"taxonomy":"msr-session-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-session-type?post=185000"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=185000"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=185000"},{"taxonomy":"msr-episode","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-episode?post=185000"},{"taxonomy":"msr-research-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-theme?post=185000"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}