Variable-sized bin packing and bin covering

Document Type

Syllabus

Publication Date

1-1-2007

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.

Identifier

85014239802 (Scopus)

ISBN

[1584885505, 9781584885504, 9781420010749]

Publication Title

Handbook of Approximation Algorithms and Metaheuristics

External Full Text Location

https://doi.org/10.1201/9781420010749

First Page

34

Last Page

34

This document is currently not available here.

Share

COinS