This work presents the first study of using the popular Monte Carlo Tree Search (MCTS)
method combined with dedicated heuristics for solving the Weighted Vertex Coloring …

In this article we propose a heuristic algorithm to explore search space trees associated with
instances of combinatorial optimization problems. The algorithm is based on Monte Carlo …

Abstract The aim of Traffic Engineering is to provide routing configurations in networks such
that the used resources are minimized while maintaining a high level of quality of service …

Abstract Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm that
learns a playout policy in order to solve a single player game. In this paper we apply NRPA …

Generalized Nested Rollout Policy Adaptation (GNRPA) is a Monte Carlo search algorithm
for optimizing a sequence of choices. We propose to improve on GNRPA by avoiding too …

This paper explores Monte-Carlo Search algorithms applied to Multiagent Systems (MAS),
specifically focusing on the problem of Coalition Structure Generation (CSG). CSG is a NP …

Limited Discrepancy Search (LDS) is a popular algorithm to search a state space with a
heuristic to order the possible actions. Nested Search (NS) is another algorithm to search a …

This work investigates the Monte Carlo Tree Search (MCTS) method combined with
dedicated heuristics for solving the Weighted Vertex Coloring Problem. In addition to the …

The Graph Coloring Problem is a well-known NP-hard problem. Over the years, numerous
scholars have been pursuing efficient algorithms to obtain high-quality solutions. Nested …

In Monte-Carlo based algorithms, we generate a lot of playouts by successively playing
moves. Building the current list of possible moves for each turn of a game becomes a time …