\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470): Difference between revisions

The paper introduces new classes of valid inequalities for the mixed-integer knapsack set. They are called \(n\)-step mingling inequalities and are derived by incorporating upper bounds on integer variables into \(n\)-step mixed integer rounding inequalities. Thus they unify the concepts of mingling inequalities and \(n\)-step mixed integer rounding inequalities. It is shown that under certain conditions for each \(n\) the \(n\)-step mingling inequality defines a facet of the mixed-integer knapsack set.