On integer points in polyhedra
From MaRDI portal
Publication:1193530
DOI10.1007/BF01191202zbMath0757.52013MaRDI QIDQ1193530
Publication date: 27 September 1992
Published in: Combinatorica (Search for Journal in Brave)
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
90C10: Integer programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Brick decompositions and the matching rank of graphs
- The vertices of the knapsack polytope
- Integer Programming with a Fixed Number of Variables
- On Counting Lattice Points in Polyhedra
- Minkowski's Convex Body Theorem and Integer Programming
- The Complexity of Enumeration and Reliability Problems
- Two Algorithms for Determining Volumes of Convex Polyhedra
- On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint