![An analysis of lower bound procedures for the bin packing problem [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR47N2.jpg)
An analysis of lower bound procedures for the bin packing problem [An article from: Computers and Operations Research]
Book Details
Author(s)J.-M. Bourjolly, V. Rebetez
PublisherElsevier
ISBN / ASINB000RR47N2
ISBN-13978B000RR47N3
AvailabilityAvailable for download now
Sales Rank99,999,999
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2005. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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 Labbe, Laporte and Mercure. We prove that LB3>=LB2. We also prove that the worst-case asymptotic performance ratio of LB3 is 34 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.
Description:
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 Labbe, Laporte and Mercure. We prove that LB3>=LB2. We also prove that the worst-case asymptotic performance ratio of LB3 is 34 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.
