INFORMS Journal on Computing
| Hi-index | 0.00 |
We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors $x\in \mathbb{Z}_{+}^{n}$ that satisfy $C^{T}x\geq b$, with $C\in \mathbb{Z}_{++}^{n}$ and $b\in \mathbb{Z}_{++}$. We present some general results about the nontrivial facet-defining inequalities. Then we derive specific families of valid inequalities, namely, rounding, residual capacity, and lifted rounding inequalities, and identify cases where they define facets. We also study some known families of valid inequalities called 2-partition inequalities and improve them using sequence-independent lifting.