\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6028709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set |
scientific article; zbMATH DE number 6028709 |
Statements
\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (English)
0 references
27 April 2012
0 references
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.
0 references
mixed integer programming
0 references
mixed-integer knapsack set
0 references
valid inequality
0 references
facet
0 references
0 references
0.8467229604721069
0 references
0.8444204330444336
0 references
0.8358398675918579
0 references
0.8305637836456299
0 references
0.813858687877655
0 references
