Local methods for solving one class of integer linear programming problems (Q1569330)

This paper describes several procedures for the determination of local minima of Boolean linear programming problems whose linear functionals and linear constraints have nonnegative coefficients. Each of these procedures was developed for the problems with singularities in order to find a local minimum close to the global one. The procedures developed are used to construct several approximate algorithms of the ``local-search'' type that differ in accuracy and complexity.