Simple Explicit Formula for Counting Lattice Points of Polyhedra

DOI10.1007/978-3-540-72792-7_28zbMath1136.90522arXivmath/0702406OpenAlexW1520871840MaRDI QIDQ5429280

Eduardo S. Zeron, Jean-Bernard Lasserre

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

This page was built for publication: Simple Explicit Formula for Counting Lattice Points of Polyhedra