An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
DOI10.1287/MOOR.1050.0145zbMATH Open1082.05007OpenAlexW2159928578MaRDI QIDQ5704239FDOQ5704239
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
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
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)
Cited In (9)
- Title not available (Why is that?)
- On Counting Integral Points in a Convex Rational Polytope
- Effective lattice point counting in rational convex polytopes
- Counting integral points in polytopes via numerical analysis of contour integration
- An algorithm reconstructing convex lattice sets.
- On lattice point counting in \(\varDelta\)-modular polyhedra
- The many aspects of counting lattice points in polytopes
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Simple Explicit Formula for Counting Lattice Points of Polyhedra
Uses Software
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)
