. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an … insertion-based dominance test. The lower bounding procedure and the branch-and-bound algorithms are tested on a wide set of … randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally …

column generation in the branch and bound search. The basis is a subgradient technique applied to a Lagrangian dual …