ausblenden:
Schlagwörter:
-
Zusammenfassung:
We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and non-primitive constraints and a general notion of branch-and-infer. We compare the two approaches with respect to their modeling and solving capabilities. We introduce symbolic constraint abstractions into integer programming. Finally, we discuss possible combinations of the two approaches.