How to find the convex hull of all integer points in a polyhedron?
From MaRDI portal
Publication:2162699
DOI10.1007/s11590-021-01729-wzbMath1497.90135arXiv2010.13147OpenAlexW3153603514MaRDI QIDQ2162699
S. O. Semenov, Nikolai Yu. Zolotykh
Publication date: 9 August 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13147
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normaliz: Algorithms for affine monoids and rational cones
- Inverse integer programming
- On integer points in polyhedra
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
- Effective lattice point counting in rational convex polytopes
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- On the linear ranking problem for integer linear-constraint loops
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Ranking Functions for Linear-Constraint Loops
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Algebraic theory of linear inequalities
- Accelerating Fourier–Motzkin elimination using bit pattern trees
This page was built for publication: How to find the convex hull of all integer points in a polyhedron?
