{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:29Z","timestamp":1761620969612},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10107-007-0175-8","type":"journal-article","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T20:57:02Z","timestamp":1188507422000},"page":"273-290","source":"Crossref","is-referenced-by-count":10,"title":["FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension"],"prefix":"10.1007","volume":"115","author":[{"given":"Jes\u00fas A.","family":"De Loera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Hemmecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"K\u00f6ppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,1]]},"reference":[{"key":"175_CR1","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A.I. Barvinok","year":"1994","unstructured":"Barvinok A.I. (1994). Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19: 769\u2013779","journal-title":"Math. Oper. Res."},{"key":"175_CR2","unstructured":"Barvinok, A.I., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics, Math. Sci. Res. Inst. Publ., vol. 38. Cambridge University Press, Cambridge, pp. 91\u2013147 (1999)"},{"key":"175_CR3","unstructured":"Bellare, M., Rogaway, P.: The complexity of aproximating a nonlinear program. In: Pardalos [15]"},{"key":"175_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D.A. Cox","year":"1992","unstructured":"Cox D.A., Little J.B., O\u2019Shea D. (1992). Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Berlin"},{"key":"175_CR5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E. de Klerk","year":"2006","unstructured":"de Klerk E., Laurent M., Parrilo P.A. (2006). A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361: 210\u2013225","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"175_CR6","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.jsc.2004.02.001","volume":"38","author":"J.A. De Loera","year":"2004","unstructured":"De Loera J.A., Haws D., Hemmecke R., Huggins P., Sturmfels B., Yoshida R. (2004). Short rational functions for toric algebra and applications. J. Symbolic Comput. 38(2): 959\u2013973","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"175_CR7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/moor.1050.0169","volume":"31","author":"J.A. De Loera","year":"2006","unstructured":"De Loera J.A., Hemmecke R., K\u00f6ppe M., Weismantel R. (2006). Integer polynomial optimization in fixed dimension. Math. Oper. Res. 31(1): 147\u2013153","journal-title":"Math. Oper. Res."},{"issue":"4","key":"175_CR8","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J.A. De Loera","year":"2004","unstructured":"De Loera J.A., Hemmecke R., Tauzer J., Yoshida R. (2004). Effective lattice point counting in rational convex polytopes. J. Symbolic Comput. 38(4): 1273\u20131302","journal-title":"J. Symbolic Comput."},{"key":"175_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco"},{"key":"175_CR10","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Proceedings of the 29th Symposium on the Theory of Computing (STOC), ACM, pp. 1\u201310 (1997)","DOI":"10.1145\/258533.258536"},{"issue":"3","key":"175_CR11","first-page":"403","volume":"47","author":"J.P. Jones","year":"1982","unstructured":"Jones J.P. (1982). Universal diophantine equation. J. Symbolic Logic 47(3): 403\u2013410","journal-title":"J. Symbolic Logic"},{"key":"175_CR12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra H.W. (1983). Integer programming with a fixed number of variables. Math. Oper. Res. 8: 538\u2013548","journal-title":"Math. Oper. Res."},{"key":"175_CR13","unstructured":"Matiyasevich, Y.V.: Enumerable sets are diophantine. Doklady Akademii Nauk SSSR 191, 279\u2013282 (1970), (Russian); English translation, Soviet Mathematics Doklady, vol. 11, pp. 354\u2013357 (1970)"},{"key":"175_CR14","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y.V. Matiyasevich","year":"1993","unstructured":"Matiyasevich Y.V. (1993). Hilbert\u2019s Tenth Problem. The MIT Press, Cambridge"},{"key":"175_CR15","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M. (ed.): Complexity in numerical optimization. World Scientific, Singapore (1993)","DOI":"10.1142\/2041"},{"issue":"3","key":"175_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar J. (1992). 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 reals. J. Symbolic Comput. 13(3): 255\u2013300","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"175_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(10)80004-5","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar J. (1992). On the computational complexity and geometry of the first-order theory of the reals, part II: the general decision problem. Preliminaries for quantifier elimination. J. Symbolic Comput. 13(3): 301\u2013328","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"175_CR18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar J. (1992). On the computational complexity and geometry of the first-order theory of the reals. part III: Quantifier elimination. J. Symbolic Comput. 13(3): 329\u2013352","journal-title":"J. Symbolic Comput."},{"issue":"6","key":"175_CR19","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1137\/0221060","volume":"21","author":"J. Renegar","year":"1992","unstructured":"Renegar J. (1992). On the computational complexity of approximating solutions for real algebraic formulae. SIAM J. Comput. 21(6): 1008\u20131025","journal-title":"SIAM J. Comput."},{"key":"175_CR20","doi-asserted-by":"crossref","unstructured":"Vavasis, S.A.: Polynomial time weak approximation algorithms for quadratic programming. In: Pardalos [15]","DOI":"10.1142\/9789814354363_0022"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0175-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0175-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0175-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:04Z","timestamp":1559109004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0175-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0175-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,1]]}}}