Primal Integer Programming
by
Robert Weismantel
Universitaet Magdeburg

This talk gives an overview on the design of augmentation algorithms for general integer programs.

We begin our discussions with complexity issues related to an efficient augmentation strategy.

From a theoretical point of view, augmentation algorithms rely on the study of irreducible sets of points. This issue is analyzed in detail.

The talk focuses also on algorithmic approaches to primal integer programming. In particular, we will present a new integer programming algorithm that is based on the theory of irreducible sets of points. Computational results show that this approach is promissing.

Date received: February 26, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafv-41.