Complexity of integer quasiconvex polynomial optimization

Journal of Complexity

Volumn 21, Issue 4, 2005, Pages 543-556

  Heinz, Sebastian ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Integer optimization; Lenstra's algorithm; Quasiconvex polynomials

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; SET THEORY;

INTEGER OPTIMIZATION; LENSTRA ALGORITHM; QUASICONVEX POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 21844472492     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2005.04.004     Document Type: Article

References (16)

1. M. Aigner Diskrete Mathematik. Vieweg Studium 1993 Friedr. Vieweg & Sohn
2. B. Bank R. Mandel Parametric Integer Optimization 1988 Akademie-Verlag Berlin
3. B. Bank J. Heintz T. Krick R. Mandel P. Solernó Une borne géométrique pour la programmation entière à contraintes polynomiales C. R. Acad. Sci. Ser. I 310 6 1990 475-478
4. B. Bank, Optimization and real equation solving, in: II Escuela de Matemática Aplicada (25 al 29 de agosto de 1997): Notas de los Cursos, Universidad de Buenos Aires, 1997.
5. M.R. Garey D.S. Johnson Computers and Intractability 1979 W. H. Freeman and Company New York
6. M. Grötschel, L. Lovász, A. Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2, second, corrected ed., Springer, Berlin, 1993.
7. R.G. Jeroslow There cannot be any algorithm for integer programming with quadratic constraints Oper. Res. 21 1973 221-224
8. F. John Extremum problems with inequalities as subsidiary conditions, in: Studies and Essays presented to R. Courant on his 60th Birthday, January 8th 1948 Interscience Publishers New York 187-204
9. L. Khachiyan Convexity and complexity in polynomial programming, in: Proceedings of the International Congress of Mathematicians, August 1983 Warsaw 16-24
10. L. Khachiyan L. Porkolab Integer optimization on convex semialgebraic sets Discrete Comput. Geom. 23 2000 207-224
11. A.K. Lenstra H.W. Lenstra L. Lovász Factoring polynomials with rational coefficients Math. Ann. 261 1982 515-534
12. H.W. Lenstra Integer programming with a fixed number of variables Math. Oper. Res. 8 1983 538-548
13. J.V. Matiyasevic The diophantineness of enumerable sets Dokl. Akad. Nauk SSSR 191 1970 279-282
14. A. Schrijver Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics and Optimization 1994 Wiley New York
15. J. Stoer C. Witzgall Convexity and optimization in finite dimension I, Grundlehren der mathematischen Wissenschaften vol. 163 1970 Springer Berlin
16. J. von zur Gathen J. Gerhard Modern Computer Algebra 1999 Cambridge University Press Cambridge