Design of rectangular packings using decoders of block structure

Consideration was given to different formulations of the rectangle packing problem for which methods of information coding exist. Information is used by the decoder algorithms to design the permissible packings and their esquisses. The decoders are single-pass heuristics of polynomial complexity. Decoder design relied on the block representations of packing. The existing decoders such as the bottom-left, sequence pair, block design, and substitution were presented along with new modifications of the block approach to the deterministic heuristics. The results of numerical experiment and comparative analysis of decoder operation were presented in conclusion.