Operations Research Center

This talk deals with the design of augmentation algorithms for linear integer programs. We will mainly focus on algorithmic approaches. In particular, a new integer programming algorithm based on the theory of irreducible lattice points will be presented. Computational results in the general case will demonstrate that this approach is promising. We also discuss some specific combinatorial applications and mention recent progress in the design of combinatorial augmentation algorithms.