Computing the integer hull of convex polyhedral sets
From MaRDI portal
Publication:2109987
DOI10.1007/978-3-031-14788-3_14OpenAlexW4298439955MaRDI QIDQ2109987
Marc Moreno Maza, Linxiao Wang
Publication date: 21 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_14
Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Normaliz: Algorithms for affine monoids and rational cones
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Counting integer points in parametric polytopes using Barvinok's rational functions
- The vertices of the knapsack polytope
- On integer points in polyhedra
- Computing the integer points of a polyhedron. I: Algorithm
- Computing the face lattice of a polytope from its vertex-facet incidences
- Computing convex hulls and counting integer points with \texttt{polymake}
- Edmonds polytopes and a hierarchy of combinatorial problems
- Effective lattice point counting in rational convex polytopes
- An Automatic Method of Solving Discrete Programming Problems
- Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
- On Cutting Planes
- The quickhull algorithm for convex hulls
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
