Integer programming by group theory: computational results

A group theoretic algorithm for the integer program has been computer programmed and tested. It basically consists of a linear programming algorithm, a routine which converts the (relaxed) integer program to a group minimization problem (over the fractional column group or the isomorphic factor group attained via Smith's Normal Form), solving the group problem by dynamic programming or by a shortest path algorithm, and when necessary, uses a branch and bound procedure. Details and computational results are given. Future work regarding other computational strategies available to group theoretic algorithms is also included.