Algebraic unimodular counting
From MaRDI portal
Publication:1424267
DOI10.1007/s10107-003-0383-9zbMath1059.90105arXivmath/0104286OpenAlexW2092636674MaRDI QIDQ1424267
Bernd Sturmfels, Jesús A. De Loera
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0104286
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
A vector partition function for the multiplicities of \(\mathfrak{sl}_k\mathbb C\), On Kostant's weight \(q\)-multiplicity formula for \(\mathfrak{sl}_4(\mathbb{C})\), Effective lattice point counting in rational convex polytopes, Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes, Exact sampling and counting for fixed-margin matrices, Asymptotics of multivariate sequences. IV: Generating functions with poles on a hyperplane arrangement, The Ehrhart polynomial of the Birkhoff polytope, Root cones and the resonance arrangement, Approximating the volume of tropical polytopes is difficult, An invitation to the generalized saturation conjecture, A divide-and-conquer algorithm for generating Markov bases of multi-way tables, Counting integer points of flow polytopes
Uses Software
