The rectangular packing problem: local optimum search methods based on block structures

Orthogonal packing of rectangles in a semi-infinite strip and its representation by block structures, which reduces the problem to a special linear cutting problem, are studied. Schemes for constructing local optimum search methods and deterministic and probabilistic algorithms are designed. The results of a numerical experiment corroborating the effectiveness of new methods are given.

Presented by the member of Editorial Board: A. I. Kibzun