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. © 2011 Springer-Verlag.
CITATION STYLE
Régin, J. C. (2011). Solving sroblems with CP: Four common pitfalls to avoid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6876 LNCS, pp. 3–11). https://doi.org/10.1007/978-3-642-23786-7_3
Mendeley helps you to discover research relevant for your work.