Integer programming, Barvinok's counting algorithm and Gomory relaxations

Authors:
Jean B. Lasserre
Affiliations:
LAAS-CNRS, 7 Avenue du Colonel Roche, 31077 Toulouse Cédex 4, France
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

Mathematics of Operations Research
Non-standard approaches to integer programming

Discrete Applied Mathematics
Computing the integer programming gap

Combinatorica

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

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm based on Barvinok's counting algorithm for P-max{c'x|Ax=