Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01344048
Contributor : Jean-Charles Regin <>
Submitted on : Tuesday, July 19, 2016 - 4:24:30 PM
Last modification on : Thursday, March 5, 2020 - 12:20:49 PM
Document(s) archivé(s) le : Thursday, October 20, 2016 - 11:13:14 AM

File

pitfalls.pdf
Files produced by the author(s)

Identifiers

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, Jimmy Ho-Man Lee, Sep 2011, Perugia, Italy. ⟨10.1007/978-3-642-23786-7_3⟩. ⟨hal-01344048⟩

Share

Metrics

Record views

132

Files downloads

315