Name
Abstract | ||
|---|---|---|
In this paper we use an extension of the well-known cover inequalities to obtain valid inequalities for 0-1 integer problems with two different sided knapsack constraints and, in general, for any kind of 0-1 integer problems having at least two different sided constraints. These inequalities cannot be derived from any of the individual constraints alone and are stronger than the cover inequalities derived from knapsack constraints individually. Given a solution, we state the conditions under which violated inequalities of this type exist, and we also propose heuristics to identify them. The application of these inequalities to different classes of 0-1 integer problems is also studied. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0167-6377(94)90010-8 | Oper. Res. Lett. |
Keywords | Field | DocType |
complete cover inequality,knapsack constraints,partial cover,cover inequality,cover inequalities,0–1 integer problems,individual constraint,well-known cover inequality,knapsack constraint,valid inequality,different class,integer problem | Integer,Discrete mathematics,Mathematical optimization,Combinatorics,Inequality,Integer programming,Heuristics,Knapsack problem,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 1 | Operations Research Letters |
Citations | PageRank | References |
2 | 0.41 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Fernández | 1 | 119 | 10.00 |
| Kurt Jørnsten | 2 | 232 | 24.52 |