Integer programming, Barvinok's counting algorithm and Gomory relaxations.

DOI10.1016/S0167-6377(03)00098-1zbMath1060.90055OpenAlexW1967723742MaRDI QIDQ1417591

Jean-Bernard Lasserre

Publication date: 5 January 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00098-1

zbMATH Keywords

generating functionsinteger programmingBarvinok's counting algortihm

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws, Short rational functions for toric algebra and applications, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Reachability analysis of low-order discrete state reaction networks obeying conservation laws, A computational study of integer programming algorithms based on Barvinok's rational functions

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the volume, counting integral points, and exponential sums
• Non-standard approaches to integer programming
• Computing the integer programming gap
• Some polyhedra related to combinatorial problems
• Effective lattice point counting in rational convex polytopes
• Integer Programming with a Fixed Number of Variables
• Points entiers dans les polyèdres convexes
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Extensions of the Group Theoretic Approach in Integer Programming