Sciweavers

Share
IPL
2008

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing

8 years 5 months ago
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provided that a removal of the last item assigned to a bin would bring the contents of the bin below the capacity. In the first variant, this last item is the minimum sized item in the bin, that is, each bin must satisfy the property that the
Leah Epstein, Asaf Levin
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IPL
Authors Leah Epstein, Asaf Levin
Comments (0)
books