Enumerating Integer Points in Polytopes with Bounded Subdeterminants

DOI10.1137/21M139935XzbMath1486.90125arXiv2102.09994OpenAlexW3130624212MaRDI QIDQ5062109

Hongyi Jiang, Amitabh Basu

Publication date: 15 March 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.09994

zbMATH Keywords

enumerationinteger pointsbounded subdeterminants

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases ⋮ Complexity of optimizing over the integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On integer programming with bounded determinants
• The width and integer optimization on simplices with bounded minors of the constraint matrices
• Nonlinear discrete optimization. An algorithmic theory
• Integer program with bimodular matrix
• On integer points in polyhedra
• On integer points in polyhedra: A lower bound
• Geometric algorithms and combinatorial optimization
• A note on non-degenerate integer programs with small sub-determinants
• A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
• Integer optimization on convex semialgebraic sets
• Complexity of integer quasiconvex polynomial optimization
• Some polyhedra related to combinatorial problems
• Integer Programming with a Fixed Number of Variables
• Integer Programming
• Minkowski's Convex Body Theorem and Integer Programming
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A strongly polynomial algorithm for bimodular integer linear programming
• The Integrality Number of an Integer Program
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings

This page was built for publication: Enumerating Integer Points in Polytopes with Bounded Subdeterminants