Abstract
Computer solutions to three-dimensional packing problems typically involve the application of one or more sets of heuristic rules in an effort to provide packings which are, primarily, volumetric efficient. This paper examines various strategies which may be adopted in the development/improvement of such heuristics and illustrates how analysis of the two-dimensional problem may be used to advantage.