Computing the integer points of a polyhedron. I: Algorithm

DOI10.1007/978-3-319-66320-3_17MaRDI QIDQ1701488zbMATH OpenOpenAlexFDO

Authors Rui-Juan Jing, Marc Moreno Maza

Publication date 23 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66320-3_17

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55)

Recommendations

• Computing the integer points of a polyhedron. II: Complexity estimates
• On integer points in polyhedra
• Computing the integer hull of convex polyhedral sets
• Computing Two-Dimensional Integer Hulls
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed

Cited in

(13)

• An arbitrary starting homotopy-like simplicial algorithm for computing an integer point in a class of polytopes
• Representation of Sets of Lattice Points
• scientific article; zbMATH DE number 3924871 (Why is no real title available?)
• Computing the integer hull of convex polyhedral sets
• EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
• The \texttt{Polyhedra} library in \textsc{Maple}
• Computing the integer points of a polyhedron
• Point containment in the integer hull of a polyhedron
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Computing the integer points of a polyhedron. II: Complexity estimates
• On the number of irreducible points in polyhedra
• Counting the integer points of parametric polytopes: a Maple implementation
• Note on the complexity of the mixed-integer hull of a polyhedron

Describes a project that uses

Uses Software

• MetaFork

This page was built for publication: Computing the integer points of a polyhedron. I: Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701488)