Solving Problems with CP: Four Common Pitfalls to Avoid - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Solving Problems with CP: Four Common Pitfalls to Avoid

Résumé

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.
Fichier principal
Vignette du fichier
pitfalls.pdf (312.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01344048 , version 1 (19-07-2016)

Identifiants

Citer

Jean-Charles Régin. Solving Problems with CP: Four Common Pitfalls to Avoid. CP 2011 - Principles and Practice of Constraint Programming - 17th International Conference, Jimmy Ho-Man Lee, Sep 2011, Perugia, Italy. ⟨10.1007/978-3-642-23786-7_3⟩. ⟨hal-01344048⟩
69 Consultations
270 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More