The representation of polyhedra by polynomial inequalities

Discrete and Computational Geometry

Volumn 29, Issue 4, 2003, Pages 485-504

  Grötschel, Martin ^a   Henk, Martin ^b,c  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037831313     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-0782-y     Document Type: Article

References (29)

1. [ABCC] D. Applegate, R. Bixby, V. Chvatal, and W. Cook, On the solution of traveling salesman problems, Doc. Math., J. DMV, Extra Vol. ICM Berlin 1998, III (1998), 645-656.
2. [ABR] C. Andradas, L. Bröcker, and J. M. Ruiz, Constructible Sets in Real Geometry, Springer-Verlag, Berlin, 1996.
3. [Ba] A. Barvinok, Approximating a norm by a polynomial, GAFA seminar notes (to appear), arXivimath. FA/0105069.
4. [BCR] J. Boohnak, M. Coste, and M.-F. Roy, Real Algebraic Geometry, Springer-Verlag, New York, 1998.
5. [Be] A. Bernig, Constructions for the theorem of Bröcker and Scheiderer, Master's thesis, Universität Dortmund, 1998.
6. [BF] T. Bonnesen and W. Fenchel, Theorie der konvexen Körper, Berichtigter Reprint, 1974 edn., Springer-Verlag, Berlin, 1934.
7. [BG] A. Brieden and P. Gritzmann, On the inapproximability of polynomial-programming, the geometry of stable sets, and the power of relaxations, Preprint, TU München, 2001.
8. [BM] J. Burési and L. Mahé, Reducing inequalities with bounds, Math. Z. 227(2) (1998), 231-243.
9. [Br] L. Bröcker, On basic semialgebraic sets, Exposition. Math. 9 (1991), 289-334.
10. [BV] A. I. Barvinok and A. M. Vershik, Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity, in Proceedings of the St. Petersburg Mathematical Society. Vol. I (O. A. Ladyzhenskaya and A. M. Vershik, eds.), American Mathematical Society, Providence, RI, 1993, pp. 1-17.
11. [CLO] D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, New York, 1992.
12. [Fi] W. Firey, Approximating convex bodies by algebraic ones, Arch. Math. 25 (1974), 424-425.
13. [GJ] E. Gawrilow and M. Joswig, polymake 1.4.1, http://www.math.tu-berlin.de/diskregeom/polymake, June 2001.
14. [GK] P. Gritzmann and V. Klee, Computational convexity, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), Ser. Discrete Math. Appl., CRC Press, Boca Raton, FL, 1997, pp. 491-515.
15. [GLS] M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, Springer-Verlag, Berlin, 1988.
16. [Ham] P. C. Hammer, Approximation of convex surfaces by algebraic surfaces, Mathematika 10 (1963), 64-71.
17. [Han] D. Handelman, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific J. Math. 132(1) (1988), 35-62.
18. [La] J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11(3) (2001), 796-817.
19. [Ma] L. Mahé, Une démonstration élémentaire du théoréme de Bröcker-Scheiderer, C. R. Acad. Sci. Paris Ser. I 309 (1989), 613-616.
20. [Mi] H. Minkowski, Volumen und Oberfläche, Math. Ann. 57 (1903), 447-495.
21. [MS] P. McMullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture, Cambridge University Press, Cambridge, 1971.
22. [MSW] J. Matouǎek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, Algorithmica 16(4-5) (1996), 498-516.
23. [PKPE] K. Polthier, S. Kadem-Al Charieh, E. Preuß, and U. Eitebuch, Javaview - 3D-geometry in web pages, http//www.javaview.de, February 2002.
24. [PR] V. Powers and B. Reznick, A new bound for Pólya's theorem with applications to polynomials positive on polyhedra, J. Pure Appl. Algebra 164 (2001), 221-229.
25. [Sc] C. Scheiderer, Stability index of real varieties, Invent. Math. 97(3) (1989), 467-483.
26. [Se] R. Seidel, Convex hull computations, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), Ser. Discrete Math. Appl., CRC Press, Boca Raton, FL, 1997, pp. 361-375.
27. [vH] G. vom Hofe, Beschreibung von ebenen konvexen n-Ecken durch höchstens drei algebraische Ungleichungen, Ph.D. thesis, Universität Dortmund, 1992.
28. [We] W. Weil, Einschachtelung konvexer Körper, Arch. Math. 26 (1975), 666-669.
29. [Zi] G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, Berlin, 1995.