On Counting Integral Points in a Convex Rational Polytope

DOI10.1287/MOOR.28.4.853.20518MaRDI QIDQ5704153zbMATH OpenOpenAlexFDO

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://semanticscholar.org/paper/593b1e14bcc62bb86e4befd1a9bfdd4c4762f60d

zbMATH Keywords

countingEhrhart polynomialintegral pointpolytope

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)

Recommendations

• An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
• Counting integral points in polytopes via numerical analysis of contour integration
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• The many aspects of counting lattice points in polytopes
• Counting with rational generating functions

Cited in

(18)

• The partial-fractions method for counting solutions to integral linear systems
• Solving the knapsack problem via \(\mathbb Z\)-transform
• Counting integer points of flow polytopes
• Polyhedral omega: a new algorithm for solving linear Diophantine systems
• A discrete Farkas lemma
• The many aspects of counting lattice points in polytopes
• Counting numerical semigroups with short generating functions.
• scientific article; zbMATH DE number 7397945 (Why is no real title available?)
• Counting the Number of Integral Points in General n-Dimensional Tetrahedra and Bernoulli Polynomials
• scientific article; zbMATH DE number 7478593 (Why is no real title available?)
• Computing Optimized Path Integrals for Knapsack Feasibility
• Counting integral points in polytopes via numerical analysis of contour integration
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
• The integer point transform as a complete invariant
• A new and faster representation for counting integer points in parametric polyhedra
• The integer hull of a convex rational polytope

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

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