Integer linear programming and finite domain constraint programming are two general approaches for solving discrete optimization problems. We present a unifying framework, branch-and-infer, to clarify the relationship between these two approaches and to show how they can be integrated.