On integer points in polyhedra
- 1 March 1992
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 12 (1) , 27-37
- https://doi.org/10.1007/bf01191202
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Counting Lattice Points in PolyhedraSIAM Journal on Computing, 1991
- A random polynomial time algorithm for approximating the volume of convex bodiesPublished by Association for Computing Machinery (ACM) ,1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- The vertices of the knapsack polytopeDiscrete Applied Mathematics, 1983
- Brick decompositions and the matching rank of graphsCombinatorica, 1982
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Two Algorithms for Determining Volumes of Convex PolyhedraJournal of the ACM, 1979
- On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single ConstraintOperations Research, 1970