An algebraic-perturbation variant of Barvinok's algorithm
From MaRDI portal
Publication:324705
Exact enumeration problems, generating functions (05A15) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Signed and weighted graphs (05C22)
Recommendations
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Computing parametric rational generating functions with a primal Barvinok algorithm
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
Cites work
Cited in
(8)- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Counting with rational generating functions
- Computing parametric rational generating functions with a primal Barvinok algorithm
- scientific article; zbMATH DE number 6117079 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
This page was built for publication: 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 Q324705)