Integer and combinatorial optimization
Integer and combinatorial optimization
| Hi-index | 0.00 |
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.