Algorithms for solving a separable problem of discrete optimization

The paper presents new exact and approximate algorithms for separable problems (with respect to the functional and the constraints) of discrete optimization, based on a unified theoretical foundation: sufficient optimality conditions. The effectiveness of the proposed algorithms is verified for the problem of optimal reservation and for non-trivial linear integer programming problems that are special cases of separable problems.