Abstract
Constraint programming is a remarkable success story. It quickly moved from research laboratories to industrial applications in the late 1980s and is in daily use to solve complex optimization throughout the world. At the same time, constraint programming has continued to evolve, addressing new needs and opportunities. This talk reviews some recent progress in constraint programming. The first part of the talk starts with its fundamental contribution, the ability to express and exploit combinatorial substructures to prune infeasible solutions and find feasible solutions. It also reviews some of the benefits of its architecture on a variety of applications in scheduling, rostering, and combinatorial matching, emphasizing the underlying modeling and computation techniques. The second part of the talk argues that constraint programming is an integration technology and reviews some hybridizations of constraint programming, including local search, mathematical programming, and global optimization. The final part of the talk gives a brief overview of some promising, novel applications of constraint programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
