Constraint Satisfaction Problems In Constraint Programming

Constraint Satisfaction Problems In Constraint Programming
Authors : Amey Kelkar
Publication Date: 30-07-2013


Author(s):  Amey Kelkar

Published in:   International Journal of Engineering Research & Technology

License:  This work is licensed under a Creative Commons Attribution 4.0 International License.

Website: www.ijert.org

Volume/Issue:   Vol.2 - Issue 8 (August - 2013)

e-ISSN:   2278-0181


Constraint satisfaction is arguably the most relevant and practical facet of programming in operational research. As a branch of constraint programming, it has received unprecedented application in airline, shipping and freight industries particularly in scheduling and rostering. The formulation and research into algorithms for constraint satisfaction problems solution has received a lot of interest among researchers owing to the robustness of solutions that can be harnessed. Beginning with an introduction on constraint programming, the paper defines and isolates a typical constraint satisfaction problem. It then delves into the topic of constraint satisfaction as a branch of constraint programming, the modes of algorithm formulation to solve constraint satisfaction problems and its applicability in real life scenarios.


Number of Citations for this article:  Data not Available


Key Word(s):    


Number of Downloads:     692

Call for Papers - May - 2017



                 Call for Thesis - 2017 

     Publish your Ph.D/Master's Thesis Online

              Publish Ph.D Master Thesis Online as Book