The aggregation closure is polyhedral for packing and covering integer programs

• 成果类型: Article
• 署名作者: Pashkovich, Kanstantsin; Poirrier, Laurent; Pulyassary, Haripriya
• 署名单位: University of Waterloo
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-021-01723-1
• 发表日期: 2022
• 页码: 1135-1147
• 关键词: cuts; strength

摘要

Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta studied the concept of aggregation cuts for packing and covering integer programs. The aggregation closure is the intersection of all aggregation cuts. Bodur et al. studied the strength of this closure, but left open the question of whether the aggregation closure is polyhedral. In this paper, we answer this question in the positive, i.e., we show that the aggregation closure is polyhedral. Finally, we demonstrate that a generalization, the k-aggregation closure, is also polyhedral for all k.