On lattice point counting in \(\varDelta\)-modular polyhedra
From MaRDI portal
Publication:2162684
DOI10.1007/s11590-021-01744-xzbMath1496.90039arXiv2010.05768OpenAlexW3164622184MaRDI QIDQ2162684
Publication date: 9 August 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05768
integer linear programmingmultidimensional knapsack problemsubset sum problemEhrhart quasi-polynomialunbounded knapsack problembounded minorsparametric polytopeshort rational generating functionstep polynomial
Related Items
Generalization of the subset sum problem and cubic forms ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A complexity dichotomy and a new boundary class for the dominating set problem
- Critical hereditary graph classes: a survey
- A new polynomial-time algorithm for linear programming
- Integer points in polyhedra
- Triangulations. Structures for algorithms and applications
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Integer program with bimodular matrix
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Lattice invariant valuations on rational polytopes
- Handbook of global optimization
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- FPT-algorithms for some problems related to integer programming
- A note on non-degenerate integer programs with small sub-determinants
- Dynamic programming revisited: Improving knapsack algorithms
- The integrality number of an integer program
- Integer conic function minimization based on the comparison oracle
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- Improving proximity bounds using sparsity
- Distances between optimal solutions of mixed-integer programs
- FPT-algorithm for computing the width of a simplex given by a convex hull
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- Geometric random edge
- On the complexity of quasiconvex integer minimization problem
- Boundary graph classes for some maximum induced subgraph problems
- Counting with rational generating functions
- Effective lattice point counting in rational convex polytopes
- Solving the stable set problem in terms of the odd cycle packing number
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Integer Programming with a Fixed Number of Variables
- Parametric Integer Programming in Fixed Dimension
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
- Sensitivity theorems in integer linear programming
- Points entiers dans les polyèdres convexes
- Polynomial algorithms in linear programming
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Short rational generating functions for lattice point problems
- The Support of Integer Optimal Solutions
- INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY
- A strongly polynomial algorithm for bimodular integer linear programming
- Minimization of even conic functions on the two-dimensional integral lattice
- On Integer Programming and Convolution.
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
- Classes of graphs critical for the edge list-ranking problem
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
- Critical elements in combinatorially closed families of graph classes
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- Partitions ofN-Space by Hyperplanes
- The maximum numbers of faces of a convex polytope
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- On sub-determinants and the diameter of polyhedra
