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.

The aggregation closure is polyhedral for packing and covering integer programs

Poirrier, Laurent;
2022-01-01

Abstract

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.
2021
Pashkovich, Kanstantsin; Poirrier, Laurent; Pulyassary, Haripriya
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11565/4053392
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact