1. Aliev, I., Henk, M., Oertel, T.: Distances to Lattice Points in Knapsack Polyhedra. Mathematical Programming, Series A. Springer, Berlin (2019)
2. Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Math. Program. 69, 429–441 (1995)
3. Conforti, M., Cornuéjols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)
4. Cook, W., Gerards, A., Schrijver, A., Tardos, E.: Sensistivity theorems in integer linear programming. Math. Program. 34, 251–264 (1986)
5. de Klerk, E., Laurent, M., Parrilo, P.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361, 210–225 (2006)