Abstract
This paper gives an algorithm for the solution of linear integer programs which is identical in spirit to Gomory's classic cutting plane procedure but uses the abelian group formulation, also pioneered by Gomory, instead. The underlying simplicity of recent algorithmic advances and their parallel with the cutting plane method are demonstrated.