Computer experiments on solving integer linear programming problems by locally stochastic algorithms

A family of approximate algorithms for solving zero-one integer linear programming problems is described. A generator of conditions of problems with known optimal solutions is proposed for the experimental study of the algorithms. The results of computer experiments are outlined.