Iteration Skipping in Primal Integer Programming

An examination of computational results using the simplified primal integer programming algorithm of Glover reveals the existence of long sequences of iterations following a specific pattern. This paper examines the structure of these sequences so that both the termination of a sequence and the tableau at that point can be predicted. It then constructs an algorithm that exploits this structure by performing the iterations of the sequence implicitly and presents computational results.