On integer points in polyhedra

DOI10.1007/BF01191202zbMath0757.52013MaRDI QIDQ1193530

S. Singh

Publication date: 27 September 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

integer programminginteger pointsinteger hull\(n\)-dimensional polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10)

Related Items

Intersection cuts for single row corner relaxations ⋮ On the pseudo-periodicity of the integer hull of parametric convex polygons ⋮ On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid ⋮ Enumerating Integer Points in Polytopes with Bounded Subdeterminants ⋮ On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming ⋮ On the number of irreducible points in polyhedra ⋮ How to find the convex hull of all integer points in a polyhedron? ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ The Support of Integer Optimal Solutions ⋮ Shrinking of time Petri nets ⋮ Parameterized complexity of configuration integer programs ⋮ Integer programming in parameterized complexity: five miniatures ⋮ From approximate to exact integer programming ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ An approximation algorithm for indefinite mixed integer quadratic programming ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Two-halfspace closure ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Random points and lattice points in convex bodies ⋮ Computing efficiently the lattice width in any dimension ⋮ A Euclid style algorithm for MacMahon's partition analysis ⋮ On integer points in polyhedra: A lower bound ⋮ The triangle closure is a polyhedron ⋮ Note on the complexity of the mixed-integer hull of a polyhedron ⋮ On approximation algorithms for concave mixed-integer quadratic programming ⋮ Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane ⋮ Approximation of convex sets by polytopes ⋮ About the Structure of the Integer Cone and Its Application to Bin Packing ⋮ Efficient Lattice Width Computation in Arbitrary Dimension ⋮ Computing the integer hull of convex polyhedral sets

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