Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Anderson et al. (2005) [1] show that for a polyhedral mixed integer set defined by a constraint system Ax<b, along with integrality restrictions on some of the variables, any split cut is in fact a split cut for a basic relaxation, i.e., one defined by a subset of linearly independent constraints. This result implies that any split cut can be obtained as an intersection cut. Equivalence between split cuts obtained from simple disjunctions of the form xj≤0 or xj<1 and intersection cuts was shown earlier for 01-mixed integer sets by Balas and Perregaard (2002) [4]. We give a short proof of the result of Anderson, Cornujols and Li using the equivalence between mixed integer rounding (MIR) cuts and split cuts. © 2011 Elsevier B.V. All rights reserved.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
A. Skumanich
SPIE OE/LASE 1992
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000