Search Results for author:
Found 1 papers, 0 papers with code
Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
