The following pages link to On integer points in polyhedra (Q1193530):
Displaying 29 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Shrinking of time Petri nets (Q378906) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- On the pseudo-periodicity of the integer hull of parametric convex polygons (Q831988) (← 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)
- 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)
- 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)
- 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)
- 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)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← 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)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← 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)
