Computational experience with an algorithm for 0-1 integer programming

In a previous paper in this journal, the authors described an implicit enumeration algorithm for the all integer programming problem. In this paper, a specialization of the aforementioned algorithm for 0-1 integer programming problems is developed. The computational efficiency of this specialization is investigated by solving a set of test problems, using a computer code of the algorithm written for this purpose. © 1978