Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

DOI10.1016/J.COR.2022.106070zbMath1520.90177arXiv2010.11523MaRDI QIDQ6351966

Pieter Leyman, Tony Wauters, Patrick de Causmaecker, Jorik Jooken

Publication date: 22 October 2020

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

This page was built for publication: Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems