@MISC{_branch-and-boundmethods, author = {}, title = {BRANCH-AND-BOUND METHODS FOR INTEGER PROGRAMMING, Branch-and-Bound Overview.}, year = {} }

Share

OpenURL

Abstract

optimization problem in which some or all of the variables are restricted to take on only integer values. The exposition presented here will focus on the case in which the objective and constraints of the optimization problem are defined via linear functions. In addition, for simplicity, it will be assumed that all of the variables are restricted to be nonnegative integer valued. Thus, the mathematical formulation of the problem under consideration can be stated as: maximize c T x subject to Ax ≤ b (IP) x ∈ Z n + where A ∈ℜ m×n, b ∈ℜ m and c ∈ℜ n.Fornotational convenience, let S denote the constraint