Motivation
General Pure Integer Program
min{cx | BxB + NxN = b,      xB, xN ³ 0, integer}
Group Problem (Relaxation)
min{cx | NxN º b (mod B),   xN ³ 0, integer}
Cyclic Group Problem (Relaxation)
x1 + 2x2 + 3x3 + … + (n-1)xn-1 º r (mod n)
xj ³ 0, integer "j, x¹0