Pages that link to "Item:Q1701488"
From MaRDI portal
The following pages link to Computing the integer points of a polyhedron. I: Algorithm (Q1701488):
Displaying 6 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Computing the integer points of a polyhedron. II: Complexity estimates (Q1701489) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed (Q4698099) (← links)
- Counting the integer points of parametric polytopes: a Maple implementation (Q6660327) (← links)