Solving Problems with CP: Four Common Pitfalls to Avoid
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.
Unable to display preview. Download preview PDF.
- 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
- 5.Korf, R.: An improved algorithm for optimal bin packing. In: Proc. IJCAI 2003, pp. 1252–1258 (2003)Google Scholar
- 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.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