Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem KU Leuven
In recent years, the scientific community has shown a growing interest in machine learning algorithms applied in the context of combinatorial optimization. Typically, the performance of a combinatorial optimization algorithm heavily relies on how well the algorithm is able to exploit the combinatorial properties of the specific problem at hand. This manifests itself, for example, in the necessity to model a problem in an appropriate way so that ...