Author:
De Loera J.A.,Haws D.,Hemmecke R.,Huggins P.,Yoshida R.
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference15 articles.
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. Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed;Barvinok;Math. Oper. Res.,1994
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. Short rational generating functions for lattice point problems;Barvinok;J. Amer. Math. Soc.,2003
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.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献