### Abstract

In this chapter we continue our survey with a focus on two variants of the one-dimensional bin packing problem: the variable-sized bin packing problem and the bin covering problem. In Section 34.2, we survey algorithms for packing into bins of different sizes, a problem first studied by Friesen and Langston [1] in 1986. In Section 34.3, we survey the bin covering problem, which asks for a partition of a given set of items into a maximum number of subsets such that, in every subset, the total item size is always at least some lower bound. This problem was first studied by Assmann et al. [2] in 1984. Concluding remarks are given in Section 34.4.

Original language | English |
---|---|

Title of host publication | Handbook of Approximation Algorithms and Metaheuristics |

Publisher | CRC Press |

Pages | 34-1-34-12 |

ISBN (Electronic) | 9781420010749 |

ISBN (Print) | 1584885505, 9781584885504 |

DOIs | |

Publication status | Published - jan. 1 2007 |

### ASJC Scopus subject areas

- Computer Science(all)

## Fingerprint Dive into the research topics of 'Variable-sized bin packing and bin covering'. Together they form a unique fingerprint.

## Cite this

Coffman, E. G., Csirik, J., & Leung, J. Y. T. (2007). Variable-sized bin packing and bin covering. In

*Handbook of Approximation Algorithms and Metaheuristics*(pp. 34-1-34-12). CRC Press. https://doi.org/10.1201/9781420010749