We know that integer programming with bounded dimension or fixed number of variables can be solved in polynomial time by Lenstra's result(from results of the LLL algorithm). After heavy foraging i still wasnt able to answer the following 2 questions,
1) What is the exact complexity of this poly-time algorithm?
2) Are there any practical(real world) applications of integer programming in a bounded dimension?
Any input would be useful. Thanks