Groups, bounds and cuts for integer programming problems

Abstract

Various bounds and cuts for integer programming problems have been derived from the asymptotic group problem. Here we point out how a very large range of group problems can be obtained from a given integer problem, allowing one to choose a group problem of arbitrary size to obtain enumerative bounds, and a large variety of cuts.