Skip to main content
SpringerLink
Log in

Grand challenges for constraint programming

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Every field should have its Grand Challenges. After discussing some general “why and how” issues, with brief reference to some sample challenges, we devote attention to the challenges raised by the new world of “BigData” and to some new ways of approaching the classic Grand Challenge of the Holy Grail (where one merely states the problem and the computer solves it). There can, of course, never be a definitive catalogue of Grand Challenges. The ultimate Grand Challenge is for everyone working on Constraint Programming to look up on occasion from their everyday pursuits to consider how they might contribute to a Grand Challenge, and even to try their hand at formulating their own Grand Challenges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bent, R. & Hentenryck, P.V. (2005). Online stochastic optimization without distributions. In S. Biundo, K.L. Myers, K. Rajan (Eds.), ICAPS (pp. 171–180). AAAI.

  2. Bruss, F.T. (2000). Sum the odds to one and stop. Annals of Probability, 28, 1384–1391.

    Article  MATH  MathSciNet  Google Scholar 

  3. Darwiche, A. & Marquis, P. (2002). A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR), 17, 229–264.

    MATH  MathSciNet  Google Scholar 

  4. Faltings, B. & Macho-Gonzalez, S. (2003). Open constraint optimization. In F. Rossi (Ed.), CP. Lecture notes in computer science (Vol. 2833, pp. 303–317). Springer.

  5. Faltings, B. & Macho-Gonzalez, S. (2005). Open constraint programming. Artificial Intelligence, 161(1–2), 181–208.

    Article  MATH  MathSciNet  Google Scholar 

  6. Freuder, E.C. (1997). In pursuit of the Holy Grail. Constraints, 2(1), 57–61.

    Article  Google Scholar 

  7. Freuder, E.C. (2007). Holy Grail redux. Constraint Programming Letters, 1(1), 3–5.

    MathSciNet  Google Scholar 

  8. Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F., Renso, C., Rinzivillo, S., Trasarti, R. (2010). Mobility data mining: discovering movement patterns from trajectory data. In D.G. Geers & S. Timpf (Eds.), Computational transportation science (pp. 7–10). ACM.

  9. Greenberg, A.G., Hamilton, J.R., Maltz, D.A., Patel, P. (2009). The cost of a cloud: research problems in data center networks. Computer Communication Review, 39(1), 68–73.

    Article  Google Scholar 

  10. Hentenryck, P.V. & Bent, R. (2006). Online stochastic combinatorial optimization. MIT Press.

  11. Ikonomovska, E., Gama, J., Sebastião, R., Gjorgjevik, D. (2009). Regression trees from data streams with drift detection. In J. Gama, V.S. Costa, A.M. Jorge, P. Brazdil (Eds.), Discovery science. Lecture notes in computer science (Vol. 5808, pp. 121–135). Springer.

  12. Laporte, G., Musmanno, R., Vocaturo, F. (2010). An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Science, 44(1), 125–135.

    Article  Google Scholar 

  13. Mackworth, A.K. (2000). Constraint-based agents: the ABC’s of CBA’s. In R. Dechter (Ed.), CP. Lecture notes in computer science (Vol. 1894, pp. 1–10). Springer.

  14. Maher, M.J. (2009). Soggy constraints: soft open global constraints. In I.P. Gent (Ed.), CP. Lecture notes in computer science (Vol. 5732, pp. 584–591). Springer.

  15. Neidermeier, R. (2006). Invitation to fixed parameter algorithms (Oxford lecture series in mathematics and its applications). USA: Oxford University Press.

    Book  Google Scholar 

  16. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (2007). Algorithmic game theory. New York: Cambridge University Press.

    Book  MATH  Google Scholar 

  17. Perron, L., Shaw, P., Furnon, V. (2004). Propagation guided large neighborhood search. In M. Wallace (Ed.), CP. Lecture notes in computer science (Vol. 3258, pp. 468–481). Springer.

  18. Qureshi, A., Weber, R., Balakrishnan, H., Guttag, J.V., Maggs, B.V. (2009). Cutting the electric bill for internet-scale systems. In SIGCOMM (pp. 123–134).

  19. Rossi, F., Beek, P.v., Walsh, T. (2006). Handbook of constraint programming. Foundations of artificial intelligence. New York: Elsevier.

    Google Scholar 

  20. Roughgarden, T. (2006). On the severity of Braess’s paradox: designing networks for selfish users is hard. Journal of Computer and System Sciences, 72(5), 922–953.

    Article  MATH  MathSciNet  Google Scholar 

  21. Srikantaiah, S., Kansal, A., Zhao, F. (2008). Energy aware consolidation for cloud computing. In Proceedings of HotPower.

  22. Valiant, G. & Roughgarden, T. (2006). Braess’s paradox in large random graphs. In J. Feigenbaum, J.C.I. Chuang, D.M. Pennock (Eds.), ACM conference on electronic commerce (pp. 296–305). ACM.

  23. Verfaillie, G. & Jussien, N. (2005). Constraint solving in uncertain and dynamic environments: a survey. Constraints, 10(3), 253–281.

    Article  MATH  MathSciNet  Google Scholar 

  24. Zheng, D., Ge, W., Zhang, J. (2009). Distributed opportunistic scheduling for ad hoc networks with random access: an optimal stopping approach. IEEE Transactions on Information Theory, 55(1), 205–222.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland

    Eugene C. Freuder & Barry O’Sullivan

Authors
  1. Eugene C. Freuder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barry O’Sullivan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barry O’Sullivan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Freuder, E.C., O’Sullivan, B. Grand challenges for constraint programming. Constraints 19, 150–162 (2014). https://doi.org/10.1007/s10601-013-9155-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-013-9155-1

Keywords

Search

Navigation