Serairi, M.Haouari, Mohamed2012-05-302012-05-302010-08-011571-0653http://hdl.handle.net/10679/186https://doi.org/10.1016/j.endm.2010.05.113Due to copyright restrictions, the access to the full text of this article is only available via subscription.We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti and Mingozzi is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a computational experiment.engrestrictedAccessconferenceObject3689189710.1016/j.endm.2010.05.113Bin packing problemLower boundsDual feasible function2-s2.0-77954898335