A decomposition scheme for solving problems of integer-valued linear programming☆

Abstract A DECOMPOSITION approach is described for solving problems of integer-valued linear programming with matrix of conditions of general type and two-sided constraints on the variables; the approach is based on sequential analysis and sifting of the variants. Algorithms for solving problems of this class are based on this approach, and results of computer experiments are described.