A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra

DOI10.33048/SEMI.2022.19.051MaRDI QIDQ6642664

D. S. Malyshev, Dmitriy V. Gribanov

Publication date: 25 November 2024

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

integer linear programmingcounting problemmultidimensional knapsack problemsubset-sum problemshort rational generating functionbounded sub-determinants

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Linear programming (90C05)

Related Items (1)

Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems

This page was built for publication: A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra

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