Discrete Applied Mathematics 42 (1993) 147-175 North-Holland 147 Efficient reformulation for zyxwvutsrqponmlkjihgfedcbaZYXWV 0- 1 programs - methods and computational results B.L. Dietrich, L.F. Escudero IBM Reseurch, 7. J. Watson Research Center, Yorktolcn Heights, NY, USA F. Chance Cornell University. Ithacn, NY, USA Received 15 June 1990 Revised 1 March 1991 Abstract Dietrich, B.L., L.F. Escudero and F. Chance, Efficient reformulation for O-l programs methods and computational results, Discrete Applied Mathematics 42 (1993) 147-175. We introduce two general methods for O-l program reformulation. Our first method generalizes coeffi- cient reduction, our second method generalizes lifting. Together they provide a unifying interpretation of many previously described automatic reformulation methods. The particular model structures that we consider are individual knapsack constraints, pairs of knapsack constraints, clique and cover induced inequalities, variable upper bounding constraints and capacity expansion constraints. We describe several easy applications of our reformulation procedures. Some computational experience is reported, including the currently best known results on a well-known 147 x 2655 benchmark problem. Keyu’ordst O-l programs, knapsack constraints, cutting planes, capacity expansion, variable upper bounding constraints, maximal cliques, minimal covers, coefficient reduction and increase. Correspondence to: Dr. L.F. Escudero, IBM Research, T.J. Watson Research Center, P.O. Box 218, York- town Heights, NY 10598, USA. 0166-218X/93/$06.00 0 1993 - Elsevier Science Publishers B.V. All rights reserved