Branch-and-Bound Solves Random Binary IPs in Polytime

Santanu S. Dey, Yatharth Dubey, Marco Molinaro 0001. Branch-and-Bound Solves Random Binary IPs in Polytime. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 579-591, SIAM, 2022. [doi]

Abstract

Abstract is missing.