For a binary integer program (IP) max cTx, Ax≤ b, x∈ { 0, 1 } n, where A∈ Rm × n and c∈ Rn have independent Gaussian entries and the right-hand side b∈ Rm satisfies that its negative coordinates have ℓ2 norm at most n/10, we prove that the gap between the value of the linear programming relaxation and the IP is upper bounded by poly (m) (log n) 2/ n with probability at least 1 - 1 / n7- 2 - poly ( m ). Our results give a Gaussian analogue of the classical integrality gap result of Dyer and Frieze (Math. of O.R., 1989) in the case of random packing IPs. In constrast to the packing case, our integrality gap depends only polynomially on m instead of exponentially. By recent breakthrough work of Dey, Dubey and Molinaro (SODA, 2021), the bound on the integrality gap immediately implies that branch and bound requires npoly ( m ) time on random Gaussian IPs with good probability, which is polynomial when the number of constraints m is fixed.

, ,
Lecture Notes in Computer Science
2021 International Conference on Integer Programming and Combinatorial Optimization
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Borst, S.J, Dadush, D.N, Huiberts, S, & Tiwari, S.S.K. (2021). On the integrality gap of binary integer programs with Gaussian data. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 427–442). doi:10.1007/978-3-030-73879-2_30