Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes

DOI10.1093/imrn/rnn133zbMath1163.15015arXiv0709.3810MaRDI QIDQ3613885

Alexander I. Barvinok

Publication date: 16 March 2009

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

convex optimization; asymptotic estimate; contingency table; integer flow; transportation polytope; non-negative integer matrices

Mathematics Subject Classification ID

90C25: Convex programming

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90B06: Transportation, logistics and supply chain management

90B10: Deterministic network models in operations research

15B48: Positive matrices and their generalizations; cones of matrices

15B36: Matrices of integers

Related Items

The number of graphs and a random graph with a given degree sequence, On the closest point to the origin in transportation polytopes, Matrices with prescribed row and column sums, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, An approximation algorithm for counting contingency tables