present a new branch-and-bound algorithm for this problem, which is based on a stepwise decomposition of the possible resource … our exact solution procedure with all branch-and-bound algorithms and state-of-the-art heuristics from the literature on … different benchmark sets. The results of the performance study reveal that our branch-and-bound algorithm clearly outperforms …

Current generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not … lower bounds, and by the corresponding termination criteria and node selection steps. In particular, our branch-and-bound … discarding test based on a linearization technique. We provide a convergence proof for our general branch-and-bound framework and …

storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to … solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and … bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that …