Exploratory analysis of the Monte Carlo tree search for solving the linear ordering problem
Andoni I. Garmendia, Josu Ceberio, Alexander Mendiburu · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2021
Monte-Carlo Tree Search has delivered great results in two-player game-playing and its current success has turned it into a popular choice of study in different use cases. Recently, many works have applied MCTS and, especially, its neural variant, as an end-to-end approach to solve Combinatorial Optimization Problems. However, its efficiency for solving regular Combinatorial Problems has still to be studied.