Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration

DOI10.1287/moor.2019.0997zbMath1455.52009arXiv1807.05348OpenAlexW2991080885MaRDI QIDQ5119842

Ken'ichiro Tanaka, Ryunosuke Oshiro, Hiroshi Hirai

Publication date: 1 September 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05348

zbMATH Keywords

numerical integrationtrapezoidal ruleinteger points in polytopescounting algorithm\(Z\)-transformation

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Hypergraphs (05C65) Numerical integration (65D30)

Related Items

On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Computing Optimized Path Integrals for Knapsack Feasibility

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Integer points in polyhedra
• Exact algorithms for exact satisfiability and number of perfect matchings
• Counting lattice points by means of the residue theorem
• Faster exponential-time algorithms in graphs of bounded average degree
• Effective lattice point counting in rational convex polytopes
• The Exponentially Convergent Trapezoidal Rule
• Computing the Continuous Discretely
• Residue formulae, vector partition functions and lattice points in rational polytopes
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Linear and Integer Programming vs Linear Integration and Counting
• On Counting Integral Points in a Convex Rational Polytope
• An Alternative Algorithm for Counting Lattice Points in a Convex Polytope