The strength of multi-row aggregation cuts for sign-pattern integer programs

Sign-pattern IPs are a generalization of packing IPs, where for a given column all coefficients are either non-negative or non-positive. We show that the aggregation closure for such sign-pattern IPs can be 2-approximated by the original 1-row closure. This generalizes a result for packing IPs. On the other hand, unlike in the case of packing IPs, we show that the multi-row aggregation closure cannot be well approximated by the original multi-row closure.