Abstract
This paper presents three kinds of algebraic-analytic algorithms for solving integer and mixed integer programming problems. We report both theoretical and experimental results. We use the generating function techniques introduced by A. Barvinok.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aardal, K., Lenstra, A.K., Lenstra Jr., H.W.: Hard equality constrained integer knapsacks. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 350–366. Springer, Heidelberg (2002) (preliminary version)
Aardal, K., Weismantel, R., Wolsey, L.: Non-Standard Approaches to Integer Programming. Discrete Applied Mathematics 123, 5–74 (2002)
Barvinok, A.I.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math of Operations Research 19, 769–779 (1994)
Barvinok, A.I., Pommersheim, J.: An algorithmic theory of lattice points in polyhedra. In: New Perspectives in Algebraic Combinatorics, Berkeley, CA, 1996- 1997. Math. Sci. Res. Inst. Publ., vol. 38, pp. 91–147. Cambridge Univ. Press, Cambridge (1999)
Barvinok, A.I., Woods, K.: Short rational generating functions for lattice point problems. Available at arXiv.math.CO.0211146. J. Amer. Math. Soc. 16, 957–979 (2003)
Cornuéjols, G., Urbaniak, R., Weismantel, R., Wolsey, L.A.: Decomposition of integer programs and of generating sets. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284, pp. 92–103. Springer, Heidelberg (1997)
De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. To appear in Journal of Symbolic Computation
De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Sturmfels, B., Yoshida, R.: Short rational functions for toric algebra and applications. Available at arXiv.math.CO.0307350. To appear in Journal of Symbolic Computation
De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Tauzer, J., Yoshida, R.: A User’s Guide for LattE v1.1 (2003), Software package LattE is available at http://www.math.ucdavis.edu/~latte/
Dyer, M., Kannan, R.: On Barvinok’s algorithm for counting lattice points in fixed dimension. Math of Operations Research 22, 545–549 (1997)
Hosten, S., Sturmfels, B.: Computing the integer programming gap. Available at math arXiv math.OC/0301266 (2003)
Lasserre, J.B.: Integer programming, Barvinok’s counting algorithm and Gomory relaxations. Operations Research Letters 32(2), 133–137 (2004)
Lenstra, H.W.: Integer Programming with a fixed number of variables. Mathematics of Operations Research 8, 538–548 (1983)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley Interscience, Hoboken (1986)
Thomas, R.: Algebraic methods in integer programming. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Yoshida, R. (2004). Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive