The following pages link to On integer points in polyhedra (Q1193530):
Displaying 48 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Shrinking of time Petri nets (Q378906) (← links)
- A relation between number of integral points, volumes of faces and degree of the discriminant of smooth lattice polytopes (Q412574) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- The integer hull of a convex rational polytope (Q701781) (← links)
- A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates (Q799242) (← links)
- On the pseudo-periodicity of the integer hull of parametric convex polygons (Q831988) (← links)
- Quadratic estimates for the number of integer points in convex bodies (Q861993) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (Q1345882) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Computing the integer points of a polyhedron. I: Algorithm (Q1701488) (← links)
- Computing the integer points of a polyhedron. II: Complexity estimates (Q1701489) (← links)
- On the number of integer points in a multidimensional domain (Q1741471) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Counting integer points of flow polytopes (Q2046449) (← links)
- Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Counting integer points in higher-dimensional polytopes (Q2406337) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- Integer hulls of linear polyhedra and scl in families (Q2847189) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- (Q3360964) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Direct transformations between sets of integers and hilbert polygons (Q3802652) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed (Q4698099) (← links)
- (Q4789202) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- Primitive Points in Rational Polygons (Q5148082) (← links)
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
