Branch-and-Bound Solves Random Binary IPs in Polytime

Santanu S. Dey, Yatharth Dubey, Marco Molinaro. Branch-and-Bound Solves Random Binary IPs in Polytime. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 579-591, SIAM, 2021. [doi]

Abstract

Abstract is missing.