Computing the integer hull of convex polyhedral sets

DOI10.1007/978-3-031-14788-3_14MaRDI QIDQ2109987zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

polyhedral setinteger hullparametric polyhedron

Mathematics Subject Classification ID

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)

Recommendations

• Computing Two-Dimensional Integer Hulls
• Computing convex hulls and counting integer points with \texttt{polymake}
• Computing the integer points of a polyhedron. II: Complexity estimates
• Computing the integer points of a polyhedron. I: Algorithm
• The integer hull of a convex rational polytope

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• An Automatic Method of Solving Discrete Programming Problems
• Computing convex hulls and counting integer points with \texttt{polymake}
• Computing the face lattice of a polytope from its vertex-facet incidences
• Computing the integer points of a polyhedron. I: Algorithm
• Counting integer points in parametric polytopes using Barvinok's rational functions
• Edmonds polytopes and a hierarchy of combinatorial problems
• Effective lattice point counting in rational convex polytopes
• Normaliz: Algorithms for affine monoids and rational cones
• On Cutting Planes
• On integer points in polyhedra
• On the pseudo-periodicity of the integer hull of parametric convex polygons
• The quickhull algorithm for convex hulls
• The vertices of the knapsack polytope
• ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem

Cited in

(21)

• Towards the computation of the convex hull of a configuration from its corresponding separating matrix
• Finding the exact volume of a polyhedron.
• The integer hull of a convex rational polytope
• The integer hull of a convex rational polytope
• EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
• Transformations and consecutivities on a king for computational applications
• Note on the complexity of the mixed-integer hull of a polyhedron
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• The randomized integer convex hull
• Computing Two-Dimensional Integer Hulls
• Computing convex hulls and counting integer points with \texttt{polymake}
• How to find the convex hull of all integer points in a polyhedron?
• A new algorithm to find all vertices of a polytope
• scientific article; zbMATH DE number 1960412 (Why is no real title available?)
• 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
• Computing the integer points of a polyhedron. I: Algorithm
• Computing the integer points of a polyhedron. II: Complexity estimates
• Fully Bounded Polyhedral Analysis of Integers with Wrapping

Describes a project that uses

Uses Software

• PolyhedralSets
• Polyhedra
• LattE
• Qhull
• polymake
• Normaliz
• Maple
• cdd

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)