Computing the integer points of a polyhedron. I: Algorithm

DOI10.1007/978-3-319-66320-3_17zbMATH Open1455.52011OpenAlexW2751262009MaRDI QIDQ1701488FDOQ1701488

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

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

Mathematics Subject Classification ID

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

Cited In (13)

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

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)