Computational experience with a modification of an algorithm by Hammer and Rudeanu for 0-1 linear programming

The acceleration algorithm by Hammer and Rudeanu (1) for linear zero-one programming problem was tested with several problems of small and medium size involving up to 300 variables on an IBM 360/67. The problems were chosen at random. Several modifications of the algorithm are discussed and computational experience is collected. The results shown indicate that the algorithm is computationally competitive with the other known algorithms using implicit enumeration. For all problems solved the first feasible solution is optimal. This supports the conjecture that the algorithm can be used as a procedure for finding a near optimal solution.