Integer Programming: ... Branch-and-Bound: An algorithmic framework that systematically partitions the solution space into smaller subproblems in order to isolate the optimal integer solution.

The branch and bound approach generates linear programs along the nodes of the tree using the following scheme. Consider x opt (0), the optimal solution to lp(0).If x opt (0) i is integer for all , ...

Thomas A. Lambe, Upper Bound on the Number of Nonnegative Integer Solutions to a Linear Equation, SIAM Journal on Applied Mathematics, Vol. 32, No. 1 (Jan., 1977), pp. 215-219 Free online reading for ...

This paper presents a simple numerical algorithm for the solution of programming problems in which some or all of the variables can take only discrete values. The algorithm requires no special ...