Design of rectangular packings: Block structure‐based reconstruction algorithm

Consideration was given to the problems of orthogonal packing of rectangulars in a given domain. There exist many single‐pass heuristic methods of their solution which serve as decoders in the algorithms of local search of the optimum. Some are used as constructive heuristics. In both cases, it is recommendable to use hybrid methods including tricks that improve the quality of packing. One of such tricks, the reconstruction algorithm, was described. The authors succeeded in realizing it with linear complexity of computations. The results of numerical experiment were presented.