A user's comparison of integer programming codes

A series of thirty-two integer programming test problems have been solved using six non-proprietary codes based on cutting-plane constraint algorithms, one code based on a direct tree search algorithm, and one code using a branch and bound algorithm. The efficiencies of the different integer programming codes are compared for different types of test problems.