Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packi...
David W. Boll, Jerry Donovan, Ronald L. Graham, Bo...
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest i...