Solving Graph Optimization Problems in a Framework for Monte-Carlo Search
Edelkamp, Stefan (Universität Bremen) | Externest, Eike (Universität Bremen) | Kühl, Sebastian (Universität Bremen) | Kuske, Sabine (Universität Bremen)
In this paper we solve fundamental graph optimization problems like Maximum Clique and Minimum Coloring with recent advances of Monte-Carlo Search. The optimization problems are implemented as single-agent games in a generic state-space search framework, roughly comparable to what is encoded in PDDL for an action planner.
Jun-13-2017
- Technology: