Sequential pairing of mixed integer inequalities

Citations of this article
Mendeley users who have this article in their library.


We investigate a scheme, called pairing, for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. The pairing scheme essentially produces a split cut corresponding to a specific disjunction, and can also be derived through the mixed integer rounding procedure. The scheme is in general sequence-dependent and therefore leads to an exponential number of inequalities. For some important cases, we identify combination sequences that lead to a manageable set of non-dominated inequalities. We illustrate the framework for some deterministic and stochastic integer programs and we present computational results showing the efficiency of adding the new generated inequalities as cuts. © 2007.

Author supplied keywords




Guan, Y., Ahmed, S., & Nemhauser, G. L. (2007). Sequential pairing of mixed integer inequalities. Discrete Optimization, 4(1), 21–39.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free