by Firla, R. T., Haus, U.-U., Köppe, M., Spille, B., Weismantel, R..
Series: 2001-25, Preprints
This paper deals with algorithmic issues related to the design of an augmentation algorithm for general and 0/1-integer programs. We recall the approach of integer pivoting and introduce the family of Gomory-Young augmentation vectors that can be derived from a simplex
Furthermore, a technique of combining Gomory-Young vectors and combinatorial augmentation vectors in one augmentation scheme is presented. Two computational experiments demonstrate the potential of pivoting in an integer fashion.
integer programming, primal algorithm, integer simplex, integral basis