Computing with an algebraic-perturbation variant of Barvinok's algorithm
From MaRDI portal
Recommendations
- An algebraic-perturbation variant of Barvinok's algorithm
- Computing parametric rational generating functions with a primal Barvinok algorithm
- On lattice point counting in \(\varDelta\)-modular polyhedra
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- A Primal Barvinok Algorithm Based on Irrational Decompositions
Cites work
- scientific article; zbMATH DE number 3909733 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Algebraic and geometric ideas in the theory of discrete optimization
- An algebraic-perturbation variant of Barvinok's algorithm
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Effective lattice point counting in rational convex polytopes
- Integer points in polyhedra
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Perturbation of central transportation polytopes of order \(kn \times n\)
- Perturbation of transportation polytopes
- Points entiers dans les polyèdres convexes
- Residue formulae for vector partitions and Euler-Maclaurin sums.
- The Generalized Basis Reduction Algorithm
- The misfortunes of a trio of mathematicians using computer algebra systems. Can we trust in them?
Cited in
(9)- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Counting with rational generating functions
- Towards a computer algebraic algorithm for flat output determination
- Computing parametric rational generating functions with a primal Barvinok algorithm
- An algebraic-perturbation variant of Barvinok's algorithm
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Enumerating projections of integer points in unbounded polyhedra
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Integer Programming and Combinatorial Optimization
This page was built for publication: Computing with an algebraic-perturbation variant of Barvinok's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707914)