A constraint is defined as a logical relation among several unknown quantities or variables, each taking a value in a given domain. Constraint Programming (CP) is an emergent field in operations research. Constraint programming is based on feasibility which means finding a feasible solution rather than optimization which means finding an optimal solution and focuses on the constraints and variables domain rather than the objective functions. While defining a set of constraints, this may seem a simple way to model a real-world problem but finding a good model that works well with a chosen solver is not that easy. A model could be very hard to solve if it is poorly chosen.
@artical{p372014ijcatr03071001,
Title = "A Review of Constraint Programming",
Journal ="International Journal of Computer Applications Technology and Research (IJCATR)",
Volume = "3",
Issue ="7",
Pages ="395 - 399",
Year = "2014",
Authors ="Poonam Dabas Vaishali Cooner"}