Search Results for author:
Found 1 papers, 0 papers with code
A Study of Learning Search Approximation in Mixed Integer Branch and Bound: Node Selection in SCIP
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming (MIP) branch-and-bound tree by using a learned policy.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
