| Article ID: | iaor2003383 |
| Country: | United States |
| Volume: | 31 |
| Issue: | 6 |
| Start Page Number: | 29 |
| End Page Number: | 53 |
| Publication Date: | Nov 2001 |
| Journal: | Interfaces |
| Authors: | Lustig Irvin J., Puget Jean-Franois |
| Keywords: | programming: branch and bound, artificial intelligence |
Arising from research in the computer science community, constraint programming is a fairly new technique for solving optimization problems. For those familiar with mathematical programming, a number of language barriers make it difficult to understand the concepts of constraint programming. In this short tutorial on constraint programming, we explain how it relates to familiar mathematical programming concepts and how constraint programming and mathematical programming technologies are complementary. We assume a minimal background in linear and integer programming.