On integer points in polyhedra

DOI10.1007/BF01191202zbMATH Open0757.52013MaRDI QIDQ1193530FDOQ1193530

S. Singh

Publication date: 27 September 1992

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• On integer points in polyhedra: A lower bound
• Computing the integer points of a polyhedron. II: Complexity estimates
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Counting integer points in higher-dimensional polytopes
• Point containment in the integer hull of a polyhedron

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• The Complexity of Enumeration and Reliability Problems
• Two Algorithms for Determining Volumes of Convex Polyhedra
• Title not available (Why is that?)
• The vertices of the knapsack polytope
• Title not available (Why is that?)
• Brick decompositions and the matching rank of graphs
• On Counting Lattice Points in Polyhedra
• Title not available (Why is that?)
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint

Cited In (45)

• On the pseudo-periodicity of the integer hull of parametric convex polygons
• The triangle closure is a polyhedron
• A relation between number of integral points, volumes of faces and degree of the discriminant of smooth lattice polytopes
• The integer hull of a convex rational polytope
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Title not available (Why is that?)
• Note on the complexity of the mixed-integer hull of a polyhedron
• Primitive Points in Rational Polygons
• Enumerating Integer Points in Polytopes with Bounded Subdeterminants
• Counting integer points of flow polytopes
• An approximation algorithm for indefinite mixed integer quadratic programming
• Title not available (Why is that?)
• Counting integer points in higher-dimensional polytopes
• Quadratic estimates for the number of integer points in convex bodies
• Direct transformations between sets of integers and hilbert polygons
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• Computing the integer hull of convex polyhedral sets
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
• Parameterized complexity of configuration integer programs
• Minimizing cubic and homogeneous polynomials over integers in the plane
• On the number of irreducible points in polyhedra
• Approximation of convex sets by polytopes
• From approximate to exact integer programming
• How to find the convex hull of all integer points in a polyhedron?
• Random points and lattice points in convex bodies
• On polyhedra induced by point sets in space
• Title not available (Why is that?)
• On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
• A Euclid style algorithm for MacMahon's partition analysis
• Integer programming in parameterized complexity: five miniatures
• Computing efficiently the lattice width in any dimension
• On approximation algorithms for concave mixed-integer quadratic programming
• The Support of Integer Optimal Solutions
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• Fair and efficient allocation with few agent types, few item types, or small value levels
• About the Structure of the Integer Cone and Its Application to Bin Packing
• Two-halfspace closure
• A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
• On integer points in polyhedra: A lower bound
• Shrinking of time Petri nets
• Intersection cuts for single row corner relaxations
• Efficient lattice width computation in arbitrary dimension
• Title not available (Why is that?)
• On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming

This page was built for publication: On integer points in polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193530)