Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound

This paper contains new, fast methods for handling two types of group knapsack networks—those having only unbounded variables and those having some bounded variables. The latter are embedded in a new branch-and-bound scheme for pure integer programs. This implicit enumeration scheme is nonredundant, which distinguishes it from the literature.