by Haus, U.-U., Köppe, M., Weismantel, R..
Series: 2001-23, Preprints
This paper is the computational companion to the
paper 'A Primal All-Integer Algorithm Based on
Irreducible Solutions'. We present an augmentation
heuristic for general integer programs, based on
lattice reduction, and our implementation of the
Integral Basis Method, using discrete relaxations.
Finally, we present computational results for 0/1
integer programs from the MIPLIB.
Integer programming, primal methods, integral bases, lattice reduction