- The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs Santanu S. Dey(santanu.deyisye.gatech.edu) Andres Iroume(airoume.gatechgmail.com) Guanyi Wang(gwang93gatech.edu) Abstract: In this paper, we study the strength of aggregation cuts for sign-pattern integer programs (IPs). Sign-pattern IPs are a generalization of packing IPs and are of the form {x \in Z^n | Ax <=b, x >= 0} where for a given column j, A_{ij} is either non-negative for all i or non-positive for all i. Our first result is 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. Therefore for these classes of integer programs general aggregated multi-row cutting planes can perform significantly better than just looking at cuts from multiple original constraints. Keywords: Cutting-plane, Aggregation, Multi-row cuts Category 1: Integer Programming (Cutting Plane Approaches ) Citation: Download: [PDF]Entry Submitted: 11/18/2017Entry Accepted: 11/19/2017Entry Last Modified: 11/18/2017Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.