Integer optimization on convex semialgebraic sets

Discrete and Computational Geometry

Volumn 23, Issue 2, 2000, Pages 207-224

  Khachiyan, L ^a   Porkolab, L ^b  

^a RUTGERS UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034405351     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009496     Document Type: Article

References (17)

1. L. Babai, On Lovász' Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica 6:1-13, 1986.
2. B. Bank, J. Heintz, T. Krick, R. Mandel, and P. Solernó, Une Borne Optimale pour la Programmation Entière Quasi-convexe, Bull. Soc. Math. France, 121:299-314, 1993.
3. B. Bank, T. Krick, R. Mandel, and P. Solernó, A Geometrical Bound for Integer Programming with Polynomial Constraints (extended abstract), in: Fundamentals of Computation Theory (ed. by L. Budach), Lecture Notes in Computer Science, vol. 529, pp. 121-125, Springer-Verlag, Berlin, 1991.
4. A.I. Barvinok, A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed, Math. Oper. Res., 19:769-779, 1994.
5. S. Basu, An Improved Algorithm for Quantifier Elimination over Real Closed Fields, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 56-65, 1997.
6. S. Basu, R. Pollack, and M.-R. Roy, On the Combinatorial and Algebraic Complexity of Quantifier Elimination, J. Assoc. Comput. Mach., 43:1002-1045, 1996.
7. W.S. Brown and J.F. Traub, On Euclid's Algorithm and the Theory of Subresultants, J. Assoc. Comput. Mach., 18:505-514, 1971.
8. J.W.S. Cassels, An Introduction to Diophantine Approximation, Cambridge University Press, Cambridge, 1957.
9. G.E. Collins, Polynomial Reminder Sequences and Determinants, Amer. Math. Monthly, 73:708-712, 1966.
10. M. Grötschell, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
11. F. John, Extremum Problems with Inequalities as Subsidiary Conditions, in: Studies and Essays, presented to R. Courant on his 60th Birthday, January 8th, Wiley Interscience, New York, pp. 187-204, 1948.
12. L. Khachiyan, Convexity and Complexity in Polynomial Programming, Proceedings of the International Congress of Mathematicians, Warsaw, pp. 1569-1577, 1983.
13. A.K. Lenstra, H.W. Lenstra, Jr., and L. Lovász, Factoring Polynomials with Rational Coefficients, Math. Ann., 261:515-534, 1982.
14. H.W. Lenstra, Jr., Integer Programming with a Fixed Number of Variables, Math. Oper. Res., 8:538-548, 1983.
15. M. Mignotte, Some Useful Bounds, in: Computer Algebra, Symbolic and Algebraic Computation (second edition, ed. by B. Buchberger, G.E. Collins, and R. Loos, in cooperation with R. Albrecht), Springer-Verlag, Wien, pp. 259-263, 1982.
16. J. Renegar, On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae, SIAM J. Comput., 21:1008-1025, 1992.
17. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.