More than 400 books, articles, dissertations, and working papers are included in this
bibliography on cutting and packing problems. The list of published articles and …

The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem,
which is defined as the placement of a set of different-sized items into identical bins such …

This paper updates a survey [53J written about 3 years ago. All of the results mentioned
there are covered here as well. However, as a major justification for this second edition we …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This survey considers the application of Operational Research techniques to the solution of
packing problems. Such problems arise in a variety of situations including pallet loading …

1 Introduction.-1.1. Purpose of the Investigation.-1.2. Methodology Used.-1.3. Structure of the
Book.-2 Cutting and Packing Problems as Geometric-Combinatoric Problems.-2.1. Basic …

The NP-hard problem of packing items from a given set into bins so as to maximize the
number of bins used, subject to the constraint that each bin be filled to at least a given …

In the classical version of the bin packing problem one is given a list L=(a 1,..., an) of items
(or elements) and an infinite supply of bins with capacity C. A function s (ai) gives the size of …

Bin packing problems, in which one is asked to pack items of various sizes into bins so as to
optimize some given objective function, arise in a wide variety of contexts and have been …

We study a variety of NP-hard bin packing problems under a divisibility constraint that
generalizes the often encountered situation in which all item sizes are powers of 2. For …