A computational study of integer programming algorithms based on Barvinok's rational functions
From MaRDI portal
Publication:2568332
DOI10.1016/j.disopt.2005.04.001zbMath1134.90024OpenAlexW2119416344MaRDI QIDQ2568332
Raymond Hemmecke, Ruriko Yoshida, Peter Huggins, David C. Haws, Jesús A. De Loera
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
Related Items
A partial enumeration algorithm for pure nonlinear integer programming, Application of Hadamard product to some combinatorial and probabilistic problems, Computing Optimized Path Integrals for Knapsack Feasibility, A new complexity result on multiobjective linear integer programming using short rational generating functions, An improved partial enumeration algorithm for integer programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of integer programs and of generating sets
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Short rational functions for toric algebra and applications
- Effective lattice point counting in rational convex polytopes
- Integer Programming with a Fixed Number of Variables
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Short rational generating functions for lattice point problems
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed