A new and faster representation for counting integer points in parametric polyhedra
From MaRDI portal
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A faster algorithm for counting the integer points number in -modular polyhedra
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algebraic and geometric ideas in the theory of discrete optimization
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Computing Optimized Path Integrals for Knapsack Feasibility
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Computing the Continuous Discretely
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Computing the face lattice of a polytope from its vertex-facet incidences
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Counting integral points in polytopes via numerical analysis of contour integration
- Counting lattice points by means of the residue theorem
- Counting lattice points in free sums of polytopes
- Counting with rational generating functions
- Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- scientific article; zbMATH DE number 66683 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 480251 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- Integer points in polyhedra
- Intermediate sums on polyhedra. II: Bidegree and Poisson formula
- Intermediate sums on polyhedra: computation and real Ehrhart theory
- Lattice invariant valuations on rational polytopes
- Lattice points in simple polytopes
- Linear and Integer Programming vs Linear Integration and Counting
- On -modular integer linear problems in the canonical form and equivalent problems
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- On Counting Integral Points in a Convex Rational Polytope
- On integer programming and convolution
- On lattice point counting in -modular polyhedra
- On the complexity of integer programming
- Parameterized algorithms
- Partitions ofN-Space by Hyperplanes
- Points entiers dans les polyèdres convexes
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Rational Ehrhart quasi-polynomials
- Residue formulae, vector partition functions and lattice points in rational polytopes
- Short rational generating functions for lattice point problems
- Simple Explicit Formula for Counting Lattice Points of Polyhedra
- Solving the knapsack problem via \(\mathbb Z\)-transform
- The maximum numbers of faces of a convex polytope
- The partial-fractions method for counting solutions to integral linear systems
- The proof of a generalization of Borosh-Treybig's hypothesis for Diophantine equations
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Three Ehrhart quasi-polynomials
- Triangulations. Structures for algorithms and applications
This page was built for publication: A new and faster representation for counting integer points in parametric polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878843)
