Solving Problems with CP: Four Common Pitfalls to AvoidReport as inadecuate

Solving Problems with CP: Four Common Pitfalls to Avoid - Download this document for free, or read online. Document in PDF available to download.

1 MDSC - Modèles Discrets pour les Systèmes Complexes 2 I3S - Laboratoire d-Informatique, Signaux, et Systèmes de Sophia Antipolis

Abstract : 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 sub-parts, 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.

Author: Jean-Charles Régin -



Related documents