Pages that link to "Item:Q2109987"
From MaRDI portal
The following pages link to Computing the integer hull of convex polyhedral sets (Q2109987):
Displaying 16 items.
- The integer hull of a convex rational polytope (Q701781) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set (Q1344644) (← links)
- Finding the exact volume of a polyhedron. (Q1400219) (← links)
- Computing the integer points of a polyhedron. I: Algorithm (Q1701488) (← links)
- Computing the integer points of a polyhedron. II: Complexity estimates (Q1701489) (← links)
- The randomized integer convex hull (Q1764169) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- An algorithm for the construction of convex hulls in simple integer recourse programming (Q1918422) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Recursive Calculation of Relative Convex Hulls (Q3000706) (← links)
- Computing Two-Dimensional Integer Hulls (Q4268868) (← links)
- Facial Structure and Representation of Integer Hulls of Convex Sets (Q4910825) (← links)
- Fully Bounded Polyhedral Analysis of Integers with Wrapping (Q5170176) (← links)
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix (Q5442545) (← links)
