On integer points in polyhedra
From MaRDI portal
Publication:1193530
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
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3735554 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3316189 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- Brick decompositions and the matching rank of graphs
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- On Counting Lattice Points in Polyhedra
- On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
- The Complexity of Enumeration and Reliability Problems
- The vertices of the knapsack polytope
- Two Algorithms for Determining Volumes of Convex Polyhedra
Cited in
(55)- The support of integer optimal solutions
- On approximation algorithms for concave mixed-integer quadratic programming
- On integer points in polyhedra: A lower bound
- About the Structure of the Integer Cone and Its Application to Bin Packing
- On approximation algorithms for concave mixed-integer quadratic programming
- scientific article; zbMATH DE number 942482 (Why is no real title available?)
- Primitive Points in Rational Polygons
- scientific article; zbMATH DE number 4214137 (Why is no real title available?)
- How to find the convex hull of all integer points in a polyhedron?
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Counting integer points in higher-dimensional polytopes
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- Direct transformations between sets of integers and hilbert polygons
- Two-halfspace closure
- Integral boundary points of convex polyhedra
- Computing the integer hull of convex polyhedral sets
- Random points and lattice points in convex bodies
- On the number of integer points in translated and expanded polyhedra
- A relation between number of integral points, volumes of faces and degree of the discriminant of smooth lattice polytopes
- The triangle closure is a polyhedron
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
- Integer hulls of linear polyhedra and scl in families
- Shrinking of time Petri nets
- Counting integer points of flow polytopes
- On polyhedra induced by point sets in space
- Quadratic estimates for the number of integer points in convex bodies
- Enumerating integer points in polytopes with bounded subdeterminants
- Approximation of convex sets by polytopes
- Minimizing cubic and homogeneous polynomials over integers in the plane
- Intersection cuts for single row corner relaxations
- On the number of integer points in a multidimensional domain
- scientific article; zbMATH DE number 1859219 (Why is no real title available?)
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Some estimates for the number of vertices of integer polyhedra
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
- An approximation algorithm for indefinite mixed integer quadratic programming
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- The integer hull of a convex rational polytope
- Point containment in the integer hull of a polyhedron
- A Euclid style algorithm for MacMahon's partition analysis
- From approximate to exact integer programming
- A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
- Integer programming in parameterized complexity: five miniatures
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Efficient lattice width computation in arbitrary dimension
- Parameterized complexity of configuration integer programs
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- Computing the integer points of a polyhedron. I: Algorithm
- Computing the integer points of a polyhedron. II: Complexity estimates
- On the polyhedral complexity of the integer points in a hyperball
- On the number of irreducible points in polyhedra
- Computing efficiently the lattice width in any dimension
- Note on the complexity of the mixed-integer hull of a polyhedron
- scientific article; zbMATH DE number 4053349 (Why is no real title available?)
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)
