An alternative algorithm for counting lattice points in a convex polytope

被引：9
|
作者：
Lasserre, JB
Zeron, ES
机构：
[1] CNRS, LAAS, F-31077 Toulouse, France
[2] Inst Politecn Nacl, Ctr Invest & Estudios Avanzados, Dept Math, Mexico City 07000, DF, Mexico
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2005年 / 30卷 / 03期
关键词：
convex polytopes; lattice points; generating functions; counting lattice points;
D O I：
10.1287/moor.1050.0145
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We provide an alternative algorithm for counting lattice points in the convex polytope {x is an element of R-n vertical bar Ax = b, x >= 0}. It is based on an exact (tractable) formula for the case A E that we repeatedly use for the general case A is an element of Z(mxn).
引用
收藏
页码：597 / 614
页数：18
相关论文
共 50 条
12345