Approximating the Chv\'atal--Gomory Closure of Capacity-Bounded Min-Closed Systems
Optimizing over the {0, 1/2} rank-1 Chv\`atal-Gomory (CG) closure of a binary integer linear program is NP-hard. While polynomial-time approximation schemes (PTAS) are established for monotone packing and covering formulations, extending these guarantees to mixed-sign variants remains an open challenge. In this paper,...