Abstract. The problem of location of various-sized objects is analyzed. The objective function is shown to depend on several variables, which are various combinatorial configurations. On this principle, it is divided into several subproblems; therefore, a self-adjusting algorithm is developed to solve it. A location problem for objects of the same size is solved by the structurally-alphabetical search, which is based on the known solvable case.

Keywords: combinatorial optimization, layout of different-sized objects, combinatorial configuration, objective function, method of structural-alphabetic search, permutation, set partition.