Computing the integer hull of convex polyhedral sets
DOI10.1007/978-3-031-14788-3_14OpenAlexW4298439955MaRDI QIDQ2109987FDOQ2109987
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective lattice point counting in rational convex polytopes
- An Automatic Method of Solving Discrete Programming Problems
- Computing convex hulls and counting integer points with \texttt{polymake}
- Normaliz: Algorithms for affine monoids and rational cones
- The quickhull algorithm for convex hulls
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Edmonds polytopes and a hierarchy of combinatorial problems
- The vertices of the knapsack polytope
- On integer points in polyhedra
- On Cutting Planes
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Computing the face lattice of a polytope from its vertex-facet incidences
- Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Computing the integer points of a polyhedron. I: Algorithm
Cited In (11)
- EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
- The integer hull of a convex rational polytope
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- The randomized integer convex hull
- Computing Two-Dimensional Integer Hulls
- An algorithm for the construction of convex hulls in simple integer recourse programming
- Facial Structure and Representation of Integer Hulls of Convex Sets
- An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set
- Recursive Calculation of Relative Convex Hulls
- Fully Bounded Polyhedral Analysis of Integers with Wrapping
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix
Uses Software
Recommendations
- Computing convex hulls and counting integer points with \texttt{polymake} 👍 👎
- Computing Two-Dimensional Integer Hulls 👍 👎
- The integer hull of a convex rational polytope 👍 👎
- Computing the integer points of a polyhedron. I: Algorithm 👍 👎
- Computing the integer points of a polyhedron. II: Complexity estimates 👍 👎
This page was built for publication: Computing the integer hull of convex polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109987)
