Элиминационные алгоритмы декомпозиции задач дискретной оптимизации

In this paper a class of elimination algorithms of decomposition of discrete optimization problems including local algorithms of decomposition, nonserial dynamic programming algorithms, bucket elimination algorithms, tree decomposition techniques is considered. The review is made and the basic features of the elimination algorithms of decomposition representing rather promising approach allowing in some cases to solve large-scale discrete optimization problems are described.