Name
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 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 consider undivided model, rigid search, biased benchmarking and wrong abstraction. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-23786-7_3 | CP |
Keywords | Field | DocType |
different part,combinatorial optimization problem,general technique,undivided model,particular search strategy,global model,rigid search,common pitfall,constraint programming,wrong abstraction | Mathematical optimization,Abstraction,Combinatorial optimization problem,Computer science,Constraint programming,Interval Series,Benchmarking,Global model | Conference |
Citations | PageRank | References |
1 | 0.35 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-charles Régin | 1 | 1312 | 96.59 |