The aggregation closure is polyhedral for packing and covering integer programs
K Pashkovich, L Poirrier, H Pulyassary - Mathematical Programming, 2022 - Springer
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 …
aggregation cuts for packing and covering integer programs. The aggregation closure is the …
Can cut-generating functions be good and efficient?
A Basu, S Sankaranarayanan - SIAM Journal on Optimization, 2019 - SIAM
Making cut-generating functions (CGFs) computationally viable is a central question in
modern integer programming research. One would like to find CGFs that are simultaneously …
modern integer programming research. One would like to find CGFs that are simultaneously …