Integer programming, Barvinok's counting algorithm and Gomory relaxations

Integer programming, Barvinok's counting algorithm and Gomory relaxations

0.00 Avg rating—0 Votes
Article ID: iaor20043326
Country: Netherlands
Volume: 32
Issue: 2
Start Page Number: 133
End Page Number: 137
Publication Date: Mar 2004
Journal: Operations Research Letters
Authors:
Abstract:

We propose an algorithm based on Barvinok's counting algorithm for P→max{c′x|Ax⩽b; x∈Zn}. It runs in time polynomial in the input size of P when n is fixed, and under a condition on c, provides the optimal value of P. We also related Barvinok's counting formula and Gomory relaxations.

Reviews

Required fields are marked *. Your email address will not be published.