\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-010-0382-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121888834 / rank | |||
Normal rank | |||
Revision as of 03:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set |
scientific article |
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
