An Alternative Algorithm for Counting Lattice Points in a Convex Polytope

DOI10.1287/moor.1050.0145zbMath1082.05007OpenAlexW2159928578MaRDI QIDQ5704239

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://doi.org/10.1287/moor.1050.0145

zbMATH Keywords

convex polytopes, lattice points, generating functions, counting lattice points

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (3)

Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration

Uses Software

• LattE

This page was built for publication: An Alternative Algorithm for Counting Lattice Points in a Convex Polytope