Abstract
Constraint programming has become an important technology for solving hard combinatorial problems in a diverse range of application domains. It has its roots in artificial intelligence, mathematical programming, operations research, and programming languages. In this talk we will discuss a number of challenging application domains for constraint programming, and the technical challenges that these present to the research community.
This work was supported by Science Foundation Ireland Grant 10/IN.1/3032.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
O’Sullivan, B.: Opportunities and Challenges for Constraint Programming. In: Proceedings of AAAI (2012)
Perron, L., Shaw, P., Furnon, V.: Propagation Guided Large Neighborhood Search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468–481. Springer, Heidelberg (2004)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier, New York (2006)
Van Hentenryck, P., Bent, R.: Online Stochastic Combinatorial Optimization. MIT Press (2006)
Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints 10(3), 253–281 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Sullivan, B. (2012). Where Are the Interesting Problems?. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)