An alternative algorithm for counting lattice points in a convex polytope

0.00 Avg rating—0 Votes

Article ID:	iaor20061399
Country:	United States
Volume:	30
Issue:	3
Start Page Number:	597
End Page Number:	614
Publication Date:	Aug 2005
Journal:	Mathematics of Operations Research
Authors:	Lasserre Jean B., Zeron Eduardo S.

Abstract:

We provide an alternative algorithm for counting lattice points in the convex polytope {x∈ℝⁿ|Ax⩽b, x⩾0}. It is based on an exact (tractable) formula for the case A∈ℤ^m×(m+1) that we repeatedly use for the general case A∈ℤ^m+n.

Reviews

Required fields are marked *. Your email address will not be published.