A generalized programming algorithm for integer programming problems with many columns

The generalized programming algorithm consists of major iterations and minor iterations; each major iteration consists of many minor iterations. A major iteration terminates with the addition of a Gomory cut. A minor iteration corresponds to the solution of a master linear programming problem and a group optimization problem. Activities can be deleted at the end of each minor iteration as the result of new lower bounds generated during the minor iteration. The algorithm allows most of the integer programming columns to be kept in secondary storage and evaluated in core one at a time.