A computational study of integer programming algorithms based on Barvinok's rational functions

Discrete Optimization

Volumn 2, Issue 2, 2005, Pages 135-144

  De Loera, J A ^a   Haws, D ^a   Hemmecke, R ^a   Huggins, P ^a   Yoshida, R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Barvinok's algorithm; Integer programming; Rational functions

Indexed keywords

ALGORITHMS; DATA REDUCTION; FUNCTIONS; INTEGER PROGRAMMING; LINEARIZATION; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

BARVINOK'S ALGORITHMS; INTEGRAL MATRICES; RATIONAL FUNCTION TECHNIQUES; RATIONAL FUNCTIONS;

COMPUTATIONAL METHODS;

EID: 22644432981     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.04.001     Document Type: Article

References (15)

1. K. Aardal, A.K. Lenstra, Hard equality constrained integer knapsacks, in: W.J. Cook, A.S. Schulz (Eds.), Integer Programming and Combinatorial Optimization: Ninth International IPCO Conference, Lecture Notes in Computer Science, vol. 2337, Springer, Berlin, 2002, pp. 350-366 (Preliminary version).
2. A.I. Barvinok Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed Math. Oper. Res. 19 1994 769 779
3. A.I. Barvinok, J. Pommersheim, An algorithmic theory of lattice points in polyhedra, in: New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996-1997), Mathematical Science and Research Institute Publications, vol. 38, Cambridge University Press, Cambridge, 1999, pp. 91-147.
4. A.I. Barvinok, and K. Woods Short rational generating functions for lattice point problems J. Amer. Math. Soc. 16 2003 957 979 Available at arXiv.math.CO.0211146
5. G. Cornuéjols, R. Urbaniak, R. Weismantel, L.A. Wolsey, Decomposition of integer programs and of generating sets, in: R.E. Burkard, G.J. Woeginger (Eds.), Algorithms-ESA 97, Lecture Notes in Computer Science, vol. 1284, Springer, Berlin, 1997, pp. 92-103.
6. J.A. De Loera, D. Haws, R. Hemmecke, P. Huggins, B. Sturmfels, and R. Yoshida Short rational functions for toric algebra and applications J. Symbolic Comput. 38 2 2004 959 973
7. J.A. De Loera, D. Haws, R. Hemmecke, P. Huggins, J. Tauzer, R. Yoshida, A User's Guide for LattE v1.1, 2003, Software package LattE is available at http://www.math.ucdavis.edu/ ∼ latte/
8. J.A. De Loera, R. Hemmecke, J. Tauzer, and R. Yoshida Effective lattice point counting in rational convex polytopes J. Symbolic Comput. 38 2004 1273 1302
9. M. Dyer, and R. Kannan On Barvinok's algorithm for counting lattice points in fixed dimension Math. Oper. Res. 22 1997 545 549
10. P. Henrici, Applied and Computational Complex Analysis, vol. 1, Wiley, New York, 1974.
11. P.M. Huggins, Lattice point enumeration via rational functions and applications to optimization and statistics, Senior Undergraduate Thesis, Department of Mathematics, University of California, Davis, 2004.
12. J.B. Lasserre Integer programming, Barvinok's counting algorithm and Gomory relaxations Oper. Res. Lett. 32 2 2004 133 137
13. H.W. Lenstra Jr. Integer programming with a fixed number of variables Math. Oper. Res. 8 1983 538 548
14. M. Marden, Geometry of Polynomials, second ed., American Mathematical Society, vol. 3, Mathematical Surveys, Providence, 1966.
15. A. Schrijver Theory of Linear and Integer Programming 1986 Wiley-Interscience New York