An algorithm of internal feasible directions for linear integer programming (Q809890)

This is an approximate algorithm for solving pure integer linear programming problems. Starting with an arbitrarily chosen integer point as initial solution the algorithm then uses feasible integer directions with one or two nonzero components. The basic characteristics of the algorithm are analyzed, and it is compared with other approximate algorithms. Numerical results of tests on a personal computer are also reported.