Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481816 | European Journal of Operational Research | 2007 | 9 Pages |
Abstract
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptotic worst-case performance of any lower bound for the problem and to derive for the first time the asymptotic worst-case of the well-known bound L3 by Martello and Toth. We also show that the general result allows to easily derive the asymptotic worst-case of several lower bounds proposed in the literature.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezzuto, Roberto Tadei,