FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- 1 September 2007
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 115 (2), 273-290
- https://doi.org/10.1007/s10107-007-0175-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A PTAS for the minimization of polynomials of fixed degree over the simplexTheoretical Computer Science, 2006
- Integer Polynomial Optimization in Fixed DimensionMathematics of Operations Research, 2006
- Effective lattice point counting in rational convex polytopesJournal of Symbolic Computation, 2004
- Short rational functions for toric algebra and applicationsJournal of Symbolic Computation, 2004
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is FixedMathematics of Operations Research, 1994
- Complexity in Numerical OptimizationPublished by World Scientific Pub Co Pte Ltd ,1993
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Ideals, Varieties, and AlgorithmsUndergraduate Texts in Mathematics, 1992
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983