An algebraic-perturbation variant of Barvinok's algorithm

DOI10.1016/J.ENDM.2015.07.004zbMATH Open1347.05088OpenAlexW2220230152MaRDI QIDQ324705FDOQ324705

Daphne Skipper, Jon Lee

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.004

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.

zbMATH Keywords

generating functionintegerpolyhedronBarvinok's algorithm

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed

Cited In (6)

• 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
• Title not available (Why is that?)
• 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)