On the lattice programming gap of the group problems
  We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in terms of the cost vector and the determinant of the lattice. 
Iskander Aliev
math.OC