A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

0.00 Avg rating—0 Votes
Article ID: iaor19951493
Country: United States
Volume: 19
Issue: 4
Start Page Number: 769
End Page Number: 779
Publication Date: Nov 1994
Journal: Mathematics of Operations Research
Authors:
Keywords: programming: mathematical
Abstract:

The paper proves that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d=1,2,3, and 4 only.

Reviews

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