| Article ID: | iaor19982326 |
| Country: | Belgium |
| Volume: | 35 |
| Issue: | 3/4 |
| Start Page Number: | 41 |
| End Page Number: | 59 |
| Publication Date: | Jan 1995 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Plateau G., Bennaceur H. |
| Keywords: | programming: integer, combinatorial optimization |
The concept of constraints is the classical tool of the knowledge representation in Operations Research. This concept has been also introduced in Artificial Intelligence for improving the combinatorial problem solvers. Constraint Satisfaction Problem – classically denoted by CSP – realizes a strong connection between these two research areas. This paper deals with a survey of some concepts and algorithmic tools for solving CSPs. Some links between OR and AI are finally detailed.