Disjunctive Programming XII: Intersection Cuts, Generalized Intersection Cuts, and Lift-and-Project CutsTextbook
Intersection cuts (Balas, 1971) are the founding construction of cutting-plane theory for mixed 0-1 and mixed-integer programs: given a fractional LP solution and a convex region around it known to contain no feasible integer point, the hyperplane through the points where 's boundary meets the extreme rays of the LP cone at cuts off w…