An algorithm of local search for a class of problems of integer linear programming (Q1974748)

The paper is devoted to the problem of Boolean linear programming with nonnegative coefficients of the linear functional and linear constraints. The author has proposed an algorithm of the local search type. It is based on two procedures of search for a local minimum of the linear programming problem. As a result of application of the developed procedures a set of admissible local minima for the functional has been constructed, among which the optimal one chosen is an approximation to the exact solution of the problem.