Fast lifting procedures for the bin packing problem

In this paper, we investigate fast lower bounds for the deterministic one-dimensional bin packing problem. We present two variants of a general lifting procedure which aims at systematically tightening a given lower bound. We describe several enhancements which improve the efficiency of the proposed procedure. Extensive numerical experiments show that the proposed lifting procedures consistently improve lower bounds from the literature.