Integer Polynomial Optimization in Fixed Dimension

References

• Barvinok A. I. Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. (1994) 19:769–779Link, Google Scholar
• Barvinok A. I., Pommersheim J. An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996–1997), Math. Sci. Res. Inst. Publ. (1999) Vol. 38(Cambridge University Press, Cambridge, UK) 91–147Google Scholar
• Barvinok A. I. Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. (2006) . ForthcomingGoogle Scholar
• de Klerk E., Laurent M., Parrilo P. A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. (2006) . ForthcomingGoogle Scholar
• De Loera J. A., Hemmecke R., Tauzer J., Yoshida R. Effective lattice point counting in rational convex polytopes. J. Symbolic Comput. (2004) 38(4):1273–1302Crossref, Google Scholar
• De Loera J. A., Haws D., Hemmecke R., Huggins P., Sturmfels B., Yoshida R. Short rational functions for toric algebra and applications. J. Symbolic Comput. (2004) 38(2):959–973Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Huggins P. M. Lattice point enumeration via rational functions and applications to optimization and statistics. (2004) . Senior undergraduate thesis, Department of Mathematics, University of California, Davis, CAGoogle Scholar
• Jeroslow R. G. There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res. (1973) 21(1):221–224Link, Google Scholar
• Jones J. P. Universal Diophantine equation. J. Symbolic Logic (1982) 47(3):403–410Google Scholar
• Khachiyan L., Porkolab L. Integer optimization in convex semialgebraic sets. Discrete Comput. Geom. (2000) 23:207–224Crossref, Google Scholar
• Lasserre J. B. Global optimization with polynomials and the problem of moments. SIAM J. Optim. (2001) 11:796–817Crossref, Google Scholar
• Laurent M. A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Math. Oper. Res. (2003) 28(3):470–496Link, Google Scholar
• Lenstra H. W. Integer programming with a fixed number of variables. Math. Oper. Res. (1983) 8:538–548Link, Google Scholar
• Matiyasevich Y.Hilbert’s Tenth Problem (1993) (The MIT Press, Cambridge, London, UK) Google Scholar
• Parrilo P. A., Sturmfels B., Basu S., Gonzalez-Vega L. Minimizing polynomial functions. Proc. DIMACS Workshop on Algorithmic and Quant. Aspects of Real Algebraic Geometry in Math. Comput. Sci. (2003) March 2001(American Mathematical Society, Providence, RI) 83–100Google Scholar