A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
From MaRDI portal
Publication:4698099
DOI10.1287/moor.19.4.769zbMath0821.90085MaRDI QIDQ4698099
Publication date: 14 May 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.4.769
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
90C10: Integer programming
52B55: Computational aspects related to convexity
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Short rational generating functions for lattice point problems, Values of zeta functions at negative integers, Dedekind sums and toric geometry, Counting Solutions of Integer Programs Using Unrestricted Subtree Detection, Computing the Ehrhart quasi-polynomial of a rational simplex, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant, Experiments with the site frequency spectrum, Multivariate splines and polytopes, Non-standard approaches to integer programming, Column basis reduction and decomposable knapsack problems, Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons, A generalization of the integer linear infeasibility problem, Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones., Ehrhart polynomials of matroid polytopes and polymatroids, Lattice-free polytopes and their diameter, Barvinok's algorithm and the Todd class of a toric variety, Integer programming, Barvinok's counting algorithm and Gomory relaxations., Evaluation of Dedekind sums, Eisenstein cocycles, and special values of \(L\)-functions, Refined upper bounds for the linear Diophantine problem of Frobenius, Counting with rational generating functions, The many aspects of counting lattice points in polytopes, A computational study of integer programming algorithms based on Barvinok's rational functions, Short rational functions for toric algebra and applications, Effective lattice point counting in rational convex polytopes, Ehrhart Polynomials and Successive Minima
