Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
We introduce two general methods for 0-1 program reformulation. Our first method generalizes coefficient 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 × 2655 benchmark problem. © 1993.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009