I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

Branch-and-bound solves random binary IPs in polytime:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco - p. 579-591 , 2021
Link: https://dl.acm.org/doi/10.5555/3458064.3458099