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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bessière, C., Régin, J.-C.: Enforcing arc consistency on global constraints by solving subproblems on the fly. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 103–117. Springer, Heidelberg (1999)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)
Gent, I.: Heuristic solution of open bin packing problems. Journal of Heuristics 3, 299–304 (1998)
Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1/2), 67–100 (2000)
Korf, R.: An improved algorithm for optimal bin packing. In: Proc. IJCAI 2003, pp. 1252–1258 (2003)
Martello, S., Toth, P.: Knapsack Problems. John Wiley and Sons Inc., Chichester (1990)
Puget, J.-F., Régin, J.-C.: Solving the all interval problem. In: Hnich, B., Miguel, I. (eds.) CSP Lib. (2001)
Schaus, P., Régin, J.-C., Van Hentenryck, P.: Scalable load balancing in nurse to patient assignment problems. In: CP-AI-OR 2009, pp. 233–247 (2009)
Scholl, A., Klein, R., Jürgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24, 627–645 (1997)
Van Hentenryck, P., Michel, L., Perron, L., Régin, J.-C.: Constraint programming in opl. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 98–116. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Régin, JC. (2011). Solving Problems with CP: Four Common Pitfalls to Avoid. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)