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.
No takes yet. Share an insight, caveat, or question.
Friesen et al. (1986) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: