Solving Problems with CP: Four Common Pitfalls to Avoid

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.
Type de document :
Communication dans un congrès
CP 2011 - Principles and Practice of Constraint Programming - 17th International Conference, Sep 2011, Perugia, Italy. Springer, 6876, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-23786-7_3>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01344048
Contributeur : Jean-Charles Regin <>
Soumis le : mardi 19 juillet 2016 - 16:24:30
Dernière modification le : samedi 23 juillet 2016 - 01:05:38
Document(s) archivé(s) le : jeudi 20 octobre 2016 - 11:13:14

Fichier

pitfalls.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jean-Charles Régin. Solving Problems with CP: Four Common Pitfalls to Avoid. CP 2011 - Principles and Practice of Constraint Programming - 17th International Conference, Sep 2011, Perugia, Italy. Springer, 6876, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-23786-7_3>. <hal-01344048>

Partager

Métriques

Consultations de
la notice

29

Téléchargements du document

42