A possible way to reduce degeneracy in integer programming computations

0uring a branch and bound search of an integer programme or during problem analysis variables may be declared fixed and rows may be declared redundant. The purpose of this paper is to report some preliminary results from forcing such fixed variables out of the basis in every node of a branch and bound search. At the same time an attemp is made to force non-basic slacks at zero activity on redundant rows into the basis. Both changes consume computer time, but may result in better branching and a less dense basis.