Branch and Bound Algorithms for Highly Constrained Integer Programs

In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (ILP). Thealgorithm is specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraintsare hard to satisfy. Our approach is based on recent algorithms for solving instances of Propositional Satisfiability(SAT) which are also highly constrained. In particular we illustrate how the branch and bound algorithm for solvingILPs can be improved with search...