Bibliography

1

Barvinok, A.I. and Pommersheim, J. An algorithmic theory of lattice points in polyhedra, in: New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996-1997), 91-147, Math. Sci. Res. Inst. Publ. 38, Cambridge Univ. Press, Cambridge, 1999.

2

Cornuéjols, G., Urbaniak, R., Weismantel, R., Wolsey, L.A. Decomposition of integer programs and of generating sets. R. E. Burkard, G. J. Woeginger, eds., Algorithms-ESA 97. Lecture Notes in Computer Science 1284, Springer-Verlag, 92-103, 1997.

3

De Loera, J.A., Hemmecke, R., Tauzer, J., and Yoshida, R. Effective lattice point counting in rational convex polytopes, to appear in Journal of Symbolic Computation.

4

De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Sturmfels, B., and Yoshida, R. Short rational functions for toric algebra and applications, e-print, Available via http://front.math.ucdavis.edu/math.CO/0307350, 2003.

5

De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., and Yoshida, R. Three kinds of integer programming algorithms based on Barvinok's rational functions, manuscript, 2003.

6

Fukuda, K. cdd and cdd+, The cdd and cdd plus, available via http://www.cs.mcgill.ca/~fukuda/soft/cdd_home/cdd.html.

7

Shoup, V. NTL, A library for doing Number Theory, available via http://shoup.net/ntl/.

8

Sturmfels, B. Gröbner bases and convex polytopes, university lecture series, vol. 8, AMS, Providence RI, 1996.

9

Stanley, R.P. Enumerative Combinatorics, Volume I, Cambridge, 1997.