New Procedures For Preprocessing 0-1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds

We present some preprocessing techniques for 0-1 models by taking advantage of the special structure provided by conjunctive and disjunctive variahle upper bounds, which are often used to express logical constraints. These new procedures include variable fixing, generation of clique and coverinduced inequalities, and coefficient reduction and related constraint generation procedures. By considering the information provided by the variable upper bound constraints, the procedures can be applied when the conditions required by the standard methods are not satisfied. Although some of our procedures require the solution of 0-1 problems arising from the original model, the subproblems (mainly, subset sum and set covering models) are usually small. In any case, our methodology can also be applied by using easily computed upper bounds on the optimal values of the subproblems.