Variable Sized Bin Packing
SIAM Journal on Computing1986Vol. 15(1), pp. 222–230
Citations Over TimeTop 10% of 1986 papers
Abstract
In the classical bin packing problem one seeks to pack a list of pieces in the minimum space using unit capacity bins. This paper addresses the more general problem in which a fixed collection of bin sizes is allowed. Three efficient approximation algorithms are described and analyzed. They guarantee asymptotic worst-case performance bounds of 2, ${3 / 2}$ and ${4 / 3}$.
Related Papers
- → Asymptotic fully polynomial approximation schemes for variants of open-end bin packing(2008)18 cited
- A Multi-task Selected Learning Approach for Solving New Type 3D Bin Packing Problem.(2018)
- → Bin packing and covering with longest items at the bottom: online version(2002)10 cited
- → On-line extensible bin packing with unequal bin sizes(2009)1 cited