7 citations · 16 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 2 cited
Improved Sample Complexity Bounds for Branch-and-Cut
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable pa…
cs.AI2021★ 7 cited
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Cutting-plane methods have enabled remarkable successes in integer programming over the last few decades. State-of-the-art solvers integrate a myriad of cutting-plane techniques to…