An Alternative Algorithm for Counting Lattice Points in a Convex Polytope

DOI10.1287/MOOR.1050.0145MaRDI QIDQ5704239zbMATHOpenAlexFDO

Authors E. S. Zeron, Jean B. 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

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

Recommendations

• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• Effective lattice point counting in rational convex polytopes
• On Counting Integral Points in a Convex Rational Polytope
• On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
• The many aspects of counting lattice points in polytopes

Cited in

(9)

• An algorithm reconstructing convex lattice sets.
• On Counting Integral Points in a Convex Rational Polytope
• Effective lattice point counting in rational convex polytopes
• scientific article; zbMATH DE number 1559589 (Why is no real title available?)
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• On lattice point counting in \(\varDelta\)-modular polyhedra
• The many aspects of counting lattice points in polytopes
• Counting integral points in polytopes via numerical analysis of contour integration
• Polyhedral omega: a new algorithm for solving linear Diophantine systems

Describes a project that uses

Uses Software

• LattE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704239)