1. Barvinok, A.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769–779 (1994)
2. Barvinok, A., Pommersheim, J.: An algorithmic theory of lattice points in polyhedra. In: Billera, L., Björner, A., Greene, C., Simion, R., Stanley, R. (eds.) New Perspectives in Algebraic Combinatorics, Mathematical Sciences Research Institute Publications, vol. 38, pp. 91–147. Cambridge University Press, Cambridge (1999)
3. Bellare, M., Rogaway, P.: The complexity of aproximating a nonlinear program. In: Pardalos, P. (ed.) Complexity in Numerical Optimization. World Scientific, Singapore (1993)
4. Conforti, M., Cornuéjols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)
5. Cook, W., Hartman, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27–37 (1992)