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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Hentenryck, P. (2009). Constraint Programming. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, JK., Sevaux, M. (eds) Evolutionary Multi-Criterion Optimization. EMO 2009. Lecture Notes in Computer Science, vol 5467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01020-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-01020-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01019-4
Online ISBN: 978-3-642-01020-0
eBook Packages: Computer ScienceComputer Science (R0)