Solving Problems with CP: Four Common Pitfalls to Avoid [chapter]

Jean-Charles Régin
2011 Lecture Notes in Computer Science  
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
more » ... der undivided model, rigid search, biased benchmarking and wrong abstraction.
doi:10.1007/978-3-642-23786-7_3 fatcat:mizoer5yuffj5jip5tfvlqqmdy