Efficient reformulation for 0-1 programs-Methods and computational results

The authors introduce two general methods for 0-1 program reformulation. The present first method generalizes coefficient reduction, the second method generalizes lifting. Together they provide a unifying interpretation of many previously described automatic reformulation methods. The particular model structures that the authors consider are individual knapsack constraints, pairs of knapsack constraints, clique and cover induced inequalities, variable upper bounding constraints and capacity expansion constraints. They describe several easy applications of the present reformulation procedures. Some computational experience is reported, including the currently best known results on a well-known 147×2655 benchmark problem.