Combinatorial Optimization Reading Group - Kanstantsin Pashkovich

Title: The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs

Abstract:

Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta introduced 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 talk, 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.

(Joint work with Laurent Poirrier and Haripriya Pulyassary)