A method for solving container packing for a single size of box

There is an extensive literature on heuristic algorithms for two-dimensional cutting problems and three-dimenstional packing, but there seems to be very little on the three-dimensional single-box type packing problem. This paper gives a structure for dealing with that problem as a heuristic. It also presents a set of upper bounds on the optimal fit. Finally, the paper compares a particular application of the algorithmic structure with the George and Robinson multiple-box heuristic.