Improved Sample Complexity Bounds for Branch-and-Cut
Authors: Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm and Ellen Vitercik
Paper Information
| Title: | Improved Sample Complexity Bounds for Branch-and-Cut |
| Authors: | Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm and Ellen Vitercik |
| Proceedings: | dpcp22 Doctoral Program Papers |
| Editor: | Hélène Verhaeghe |
| Keywords: | automated algorithm configuration, integer programming, machine learning theory, tree search, branch-and-bound, branch-and-cut, cutting planes, sample complexity, generalization guarantees, data-driven algorithm design |
| Pages: | 2 |
| Talk: | Aug 01 15:20 (Session 34R: Doctoral Program) |
| Paper: |  |