Branch-and-Infer: a Framework for Combining CP and IP
Abstract
We develop a unifying view of integer linear programming and finite domain constraint programming. We present the two modeling and solution approaches in a uniform framework, branch-and-infer. The goal of this framework is to clarify the relationship between the two techniques, and to indicate possible ways towards their integration. We illustrate the different concepts by examples from discrete tomography and supply chain optimization.