The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

We study the two-dimensional bin packing problem with and without rotations. Here we are
given a set of two-dimensional rectangular items I and the goal is to pack these into a …

Multidimensional packing problems generalize the classical packing problems such as Bin
Packing, Multiprocessor Scheduling by allowing the jobs to be d-dimensional vectors. While …

This book originates from a long-lasting research effort aimed at tackling difficult non-
standard packing issues arising in space engineering and logistics. In this framework the …

We consider the two-dimensional bin packing and strip packing problem, where a list of
rectangles has to be packed into a minimal number of rectangular bins or a strip of minimal …

The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

We study the two-dimensional bin packing problem: Given a list of nn rectangles the
objective is to find a feasible, ie axis-parallel and non-overlap**, packing of all rectangles …

We consider the problem of packing a set of circles into a minimum number of unit square
bins. To obtain rational solutions, we use augmented bins of height 1+ γ 1+ γ, for some …

We study non-overlap** axis-parallel packings of 3D boxes with profits into a dedicated
bigger box where rotation is either forbidden or permitted, and we wish to maximize the total …

The bin packing problem has been the corner stone of approximation algorithms and has
been extensively studied starting from the early seventies. In the classical bin packing …