| Article ID: | iaor19991439 |
| Country: | United States |
| Volume: | 10 |
| Issue: | 3 |
| Start Page Number: | 287 |
| End Page Number: | 300 |
| Publication Date: | Jun 1998 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Bockmayr Alexander, Kasper Thomas |
| Keywords: | constraint programming |
We introduce branch and infer, a unifying framework for integer linear programming and finite domain constraint programming. We use this framework to compare the two approaches with respect to their modeling and solving capabilities, to introduce symbolic constraint abstractions into integer programming, and to discuss possible combinations of the two approaches.