Solving Problems with CP: Four Common Pitfalls to Avoid

  • Jean-Charles Régin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6876)


Constraint Programming (CP) is a general technique for solving combinatorial optimization problems. Real world problems are quite complex and solving them requires to divide work into different parts. Mainly, there are: the abstraction of interesting and relevant subparts, the definition of benchmarks and design of a global model and the application of a particular search strategy. We propose to identify for each of these parts some common pitfalls and to discuss them. We will successively consider undivided model, rigid search, biased benchmarking and wrong abstraction.


Constraint Programming Round Robin Interval Series Common Pitfall Table Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bessière, C., Régin, J.-C.: Enforcing arc consistency on global constraints by solving subproblems on the fly. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 103–117. Springer, Heidelberg (1999)Google Scholar
  2. 2.
    Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)CrossRefGoogle Scholar
  3. 3.
    Gent, I.: Heuristic solution of open bin packing problems. Journal of Heuristics 3, 299–304 (1998)CrossRefzbMATHGoogle Scholar
  4. 4.
    Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1/2), 67–100 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Korf, R.: An improved algorithm for optimal bin packing. In: Proc. IJCAI 2003, pp. 1252–1258 (2003)Google Scholar
  6. 6.
    Martello, S., Toth, P.: Knapsack Problems. John Wiley and Sons Inc., Chichester (1990)zbMATHGoogle Scholar
  7. 7.
    Puget, J.-F., Régin, J.-C.: Solving the all interval problem. In: Hnich, B., Miguel, I. (eds.) CSP Lib. (2001)Google Scholar
  8. 8.
    Schaus, P., Régin, J.-C., Van Hentenryck, P.: Scalable load balancing in nurse to patient assignment problems. In: CP-AI-OR 2009, pp. 233–247 (2009)Google Scholar
  9. 9.
    Scholl, A., Klein, R., Jürgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24, 627–645 (1997)CrossRefzbMATHGoogle Scholar
  10. 10.
    Van Hentenryck, P., Michel, L., Perron, L., Régin, J.-C.: Constraint programming in opl. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 98–116. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jean-Charles Régin
    • 1
  1. 1.Université de Nice-Sophia Antipolis, I3S UMR 6070, CNRSFrance

Personalised recommendations