On Counting Integral Points in a Convex Rational Polytope

DOI10.1287/MOOR.28.4.853.20518zbMath1082.52009OpenAlexW2169157953MaRDI QIDQ5704153

Eduardo S. Zeron, Jean-Bernard Lasserre

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/593b1e14bcc62bb86e4befd1a9bfdd4c4762f60d

zbMATH Keywords

polytopecountingEhrhart polynomialintegral point

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ A discrete Farkas lemma ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration ⋮ The many aspects of counting lattice points in polytopes ⋮ COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS ⋮ Solving the knapsack problem via \(\mathbb Z\)-transform

This page was built for publication: On Counting Integral Points in a Convex Rational Polytope