Counting Integer Points in Multi-Index Transportation Polytopes
Abstract
We expand on a result of Barvinok and Hartigan to derive asymptotic formulas for the number of integer and binary integer points in a wide class of multi-index k1× k2× … × k transportation polytopes. A simple closed form approximation is given as the kjs go to infinity.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.