A computational study of integer programming algorithms based on Barvinok's rational functions

DOI10.1016/J.DISOPT.2005.04.001MaRDI QIDQ2568332zbMATH OpenOpenAlexFDO

Authors Raymond Hemmecke, Ruriko Yoshida, Jesús A. De Loera, David C. Haws, Peter Huggins

Publication date 10 October 2005

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.04.001

zbMATH Keywords

Barvinok's algorithminteger programmingrational functions

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Integer programming (90C10)

Recommendations

• Integer Programming and Combinatorial Optimization
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• An algebraic-perturbation variant of Barvinok's algorithm
• scientific article; zbMATH DE number 3959128
• Computing with an algebraic-perturbation variant of Barvinok's algorithm

Cites work

• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Decomposition of integer programs and of generating sets
• Effective lattice point counting in rational convex polytopes
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
• Short rational functions for toric algebra and applications
• Short rational generating functions for lattice point problems

Cited in

(8)

• An improved partial enumeration algorithm for integer programming problems
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• Application of Hadamard product to some combinatorial and probabilistic problems
• Computing Optimized Path Integrals for Knapsack Feasibility
• Integer Programming and Combinatorial Optimization
• Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
• A new complexity result on multiobjective linear integer programming using short rational generating functions
• A partial enumeration algorithm for pure nonlinear integer programming

Describes a project that uses

Uses Software

• LattE

This page was built for publication: A computational study of integer programming algorithms based on Barvinok's rational functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568332)