01-23

The Integral Basis Method in an Augmentation Framework for Integer Programming

by Haus, U.-U.; Köppe, M.; Weismantel, R.

 

Preprint series: 01-23, Preprints

MSC:
90C10 Integer programming

 

Abstract: 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.

Keywords: Integer programming, primal methods, integral bases, lattice reduction

Notes: Last author supported by a Gerhard-Hess-Preis and grant WE 1462 of the Deutsche Forschungsgemeinschaft, and by the European DONET program TMR ERB FMRX-CT98-0202. All authors supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt.


The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.

Letzte Änderung: 01.03.2018 - Ansprechpartner: Webmaster