?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
4
Supermodular Approximation of Norms and Applications:
, In:
?
Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science ,
5
Information Complexity of Mixed-Integer Convex Optimization:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
13
Branch-and-Bound Solves Random Binary IPs in Polytime:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
14
Branch-and-bound solves random binary IPs in polytime:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
15