Abstract
In this paper, we review LB2 and LB3, two lower bounds for the bin packing problem that were respectively introduced by Martello and Toth and by Labbé, Laporte and Mercure. We prove that LB3⩾ LB2. We also prove that the worst-case asymptotic performance ratio of LB3 is 3 4 and that this ratio cannot be improved. We study LB2, LB3 and three of their variants both analytically and computationally. In particular, we clarify the relationships between LB2″, the bound implemented by Martello and Toth in their well-known bin packing code, and both LB2 and LB3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
