It is well-known that Lenstra's famous algorithm (presented in the paper Integer programming with a fixed number of variables) can solve an ILP problem in $O^*(f(k))$ time where k is the number of variables occur in the ILP.
My question is that whether the algorithm or any of its improved versions can output all feasible solutions in $O^*(f(k))$ time?